#include <bits/stdc++.h>

using namespace std;
int n,m,k,v[2005],dp[2005][(1<<15)+1],nod,d;vector < pair <int,int> > graf[2003];
priority_queue < pair <int, pair <int,int> > , vector < pair <int, pair <int,int> > > , greater < pair <int, pair <int,int> > > > chestie;
void dijkstra () {
	while(!chestie.empty()) {
		nod=chestie.top().second.first;d=chestie.top().second.second;chestie.pop();
		for(int i=0;i<(int)graf[nod].size();++i)
			if(v[graf[nod][i].first]!=0) {
				if(dp[graf[nod][i].first][(d | (1<<(v[graf[nod][i].first]-1)))]>dp[nod][d]+graf[nod][i].second) {
					dp[graf[nod][i].first][(d | (1<<(v[graf[nod][i].first]-1)))]=dp[nod][d]+graf[nod][i].second;
					chestie.push({dp[graf[nod][i].first][(d | (1<<(v[graf[nod][i].first]-1)))],{graf[nod][i].first,(d | (1<<(v[graf[nod][i].first]-1)))}});
				}
			}
			else {
				if(dp[graf[nod][i].first][d]>dp[nod][d]+graf[nod][i].second) {
					dp[graf[nod][i].first][d]=dp[nod][d]+graf[nod][i].second;
					chestie.push({dp[graf[nod][i].first][d],{graf[nod][i].first,d}});
				}
			}
	}
}
int main () {
	int nr,nr1,nr2;
	freopen("ubuntzei.in","r",stdin);
	freopen("ubuntzei.out","w",stdout);
	scanf("%d%d%d", &n, &m, &k);
	for(int i=1;i<=k;++i)
		scanf("%d", &nr),v[nr]=i;
	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(dp,0x3f3f,sizeof(dp));dp[1][0]=0;chestie.push({0,{1,0}});dijkstra();
	printf("%d", dp[n][(1<<k)-1]);
	return 0;
}