#include<iostream>
#include<cstring>
#include<algorithm>
#include<cstdio>
#include<queue>

using namespace std;
const int N=50010,M=200010,INF=0x3f3f3f3f;

int n,m;
int head[N],ver[M],Next[N],edge[M],idx;
int dist[6][N];
priority_queue<pair<int,int> > q;
int sourse[6];
bool st[N];

void add(int a,int b,int c)
{
    ver[++idx]=b;
    edge[idx]=c;
    Next[idx]=head[a];
    head[a]=idx;
}

void dijkstra(int start,int dist[])
{
    memset(dist,0x3f, N * 4);
    memset(st,0,sizeof(st));
    dist[start]=0;
    q.push(make_pair(0,start));
    while(q.size())
    {
        int x=q.top().second;
        q.pop();
        
        if(st[x]) continue;
        st[x]=true;
        
        for(int i=head[x];~i;i=Next[i])
        {
            int y=ver[i],z=edge[i];
            if(dist[y]>dist[x]+z)
            {
                dist[y]=dist[i]+z;
                q.push(make_pair(-dist[y],y));
            }
        }
    }
}

int dfs(int u,int start,int distanse)
{
    if(u>5) return distanse;
    
    int num=INF;
    for(int i=1;i<=5;i++)
    {
        if(!st[i])
        {
            int n=sourse[i];
            st[i]=true;
            num=min(num,dfs(u+1,i,dist[start][n]));
            st[i]=false;
        }
    }
}

int main()
{
    scanf("%d%d",&n,&m);
    sourse[0]=1;
    for(int i=1;i<=5;i++) scanf("%d",&sourse[i]);
    
    for(int i=1;i<=m;i++)
    {
        int a,b,c;
        scanf("%d%d%d",&a,&b,&c);
        add(a,b,c);
        add(b,a,c);
    }
    
    for(int i=0;i<=6;i++) dijkstra(sourse[i],dist[i]);
    
    memset(st, 0, sizeof st);
    printf("%d\n", dfs(1, 0, 0));
    
    return 0;
}