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

using namespace std;
typedef pair<int,int> PII;
const int N=50010,M=2e5+10;

int n,m;
int source[7];
int h[N],e[M],ne[M],w[M],idx;
int dist[N];
bool st[N];
int d[7][N];
int res=0x3f3f3f3f;
void add(int a,int b,int c)
{
    e[idx]=b,ne[idx]=h[a],w[idx]=c,h[a]=idx++;
}

void dijkstra(int start)
{
  
    memset(dist,0x3f,sizeof dist);
    memset(st, 0, sizeof st);
    dist[start] = 0;
    d[start][start]=dist[start];
    

    priority_queue<PII, vector<PII>, greater<PII>> heap;
    heap.push({0, start});

    while (heap.size())
    {
        auto t = heap.top();
        heap.pop();

        int ver = t.second;
        if (st[ver]) continue;
        st[ver] = true;

        for (int i = h[ver]; ~i; i = ne[i])
        {
            int j = e[i];
            if (dist[j] > dist[ver] + w[i])
            {
                dist[j] = dist[ver] + w[i];
               
                d[start][j]=dist[j];
            
                heap.push({dist[j], j});
            }
        }
    }
}



int dfs(int u,int start,int distance)
{   
    
    if(u==6){
         res=min(res,distance);

    }

    
    for(int i=2;i<=6;i++)
        if(!st[i])
        {
            st[i]=true;
            dfs(u+1,i,distance+d[start][source[i]]);
            st[i]=false;
        }

}



int main()
{
    cin>>n>>m;

    source[1]=1;
    for(int i=2;i<=6;i++) cin>>source[i];
    memset(h,-1,sizeof h);
    
    
    while(m--)
    {
        int x,y,t;
        scanf("%d%d%d",&x,&y,&t);
        add(x,y,t),add(y,x,t);
    }

    for(int i=1;i<=6;i++){
      
         dijkstra(source[i]);
    }
       
    
   
    memset(st,0,sizeof st);
    dfs(1,1,0);
    printf("%d\n",res);
    return 0;
}