#include <bits/stdc++.h>

using namespace std;
int n,m,k,dist[2003][2003],dp[(1<<16)+1][16],root,nod,v[2003];vector < pair <int,int> > graf[2003];
priority_queue < pair <int,int> , vector < pair <int,int> > , greater < pair <int,int> > > chestie;
void dijkstra () {
	while(!chestie.empty()) {
		nod=chestie.top().second;chestie.pop();
		for(int i=0;i<(int)graf[nod].size();++i)
			if(dist[root][graf[nod][i].first]>dist[root][nod]+graf[nod][i].second) {
				dist[root][graf[nod][i].first]=dist[root][nod]+graf[nod][i].second;
				dist[graf[nod][i].first][root]=dist[root][graf[nod][i].first];
				chestie.push({dist[root][graf[nod][i].first],graf[nod][i].first});
			}
	}
}
int main () {
	int nr,nr1,nr2,aux,ans=1e9,aux1;
	freopen("ubuntzei.in","r",stdin);
	freopen("ubuntzei.out","w",stdout);
	scanf("%d%d%d", &n, &m, &k);
	for(int i=0;i<k;++i)
		scanf("%d", &nr),v[i]=nr;
	for(int i=1;i<=m;++i)
		scanf("%d%d%d", &nr, &nr1, &nr2),graf[nr].push_back({nr1,nr2}),graf[nr1].push_back({nr,nr2});
	memset(dist,0x3f3f,sizeof(dist));
	for(int i=1;i<=n;++i) {
		root=i;chestie.push({0,i});dist[i][i]=0;dijkstra();
	}
	memset(dp,0x3f3f,sizeof(dp));dp[0][0]=0;
	for(int j=0;j<k;++j)
		dp[(1<<j)][j]=dist[1][v[j]],dp[0][j]=0;
	for(int i=1;i<(1<<k);++i) 
		if((i & (i-1))!=0) {
			aux=i;
			for(int j=0;aux;++j)
				if((aux & (1<<j))!=0) {
					aux^=(1<<j);//updatezi dp[i][j] din dp[i ^ (1<<j)][k1];
					aux1=(i ^ (1<<j));
					for(int jj=0;aux1>0;++jj)
						if((aux1 & (1<<jj))!=0) {
							aux1^=(1<<jj);
							dp[i][j]=min(dp[i][j],dp[(i ^ (1<<j))][jj]+dist[v[jj]][v[j]]);
						}
				}
		}
	for(int i=0;i<k;++i)
		ans=min(ans,dp[(1<<k)-1][i]+dist[v[i]][n]);
	printf("%d", ans);
	return 0;
}