#include<bits/stdc++.h>
#define MAXN 50005
#define MAXM 100005
#define INF 1000000000
using namespace std;
inline int read()
{
	int x=0,f=1;
	char c=getchar();
	while(c<'0'||c>'9')
	{
		if(c=='-') f=-1;
		c=getchar();
	}
	while(c>='0'&&c<='9')
	{
		x=(x<<3)+(x<<1)+(c^48);
		c=getchar();
	}
	return x*f;
}
struct Edge
{
	int u,v,w,next;
}e[MAXM];
int head[MAXN],cnt,n,m,vis[MAXN][6],dis[MAXN][6],r[6],ans=INF,f[6],sum;
struct node
{
	int w,now;
	inline bool operator <(const node &x)const
	{
		return w>x.w;
	}
};
priority_queue<node>q;
inline void add(int u,int v,int w)
{
	e[++cnt].u=u;
	e[cnt].v=v;
	e[cnt].w=w;
	e[cnt].next=head[u];
	head[u]=cnt;
}
void dijkstra(int start,int num)
{
	for(int i=1;i<=n;++i) dis[i][num]=INF;
	dis[start][num]=0;
	while(!q.empty()) q.pop();
	q.push(node{0,start});
	while(!q.empty())
	{
		node t=q.top();
		q.pop();
		int u=t.now;
		if(vis[u][num]) continue;
		vis[u][num]=1;
		for(int i=head[u];i;i=e[i].next)
		{
			int v=e[i].v;
			if(dis[v][num]>dis[u][num]+e[i].w)
			{
				dis[v][num]=dis[u][num]+e[i].w;
				q.push((node){dis[v][num],v});
			}
		}
	}
}
void dfs(int x)
{
	int p=0;
	for(int i=0;i<=5;++i) p+=f[i];
	if(p==6) ans=min(ans,sum);
	for(int i=0;i<=5;++i)
	if(x!=i&&f[i]==0)
	{
		sum+=min(dis[r[i]][x],dis[r[x]][i]);
		f[i]=1;
		dfs(i);
		sum-=min(dis[r[i]][x],dis[r[x]][i]);
		f[i]=0;
	}
}
int main()
{
	n=read(),m=read();
	r[0]=1;
	for(int i=1;i<=5;++i) cin>>r[i];
	for(int i=1;i<=m;++i)
	{
		int u,v,w;
		u=read(),v=read(),w=read();
		add(u,v,w);
	}
	for(int i=0;i<=5;++i) dijkstra(r[i],i);
	f[1]=1;
	dfs(1);
	cout<<ans<<"\n";
	return 0;
}

球调啦