#include <stdio.h>
#include <bits/stdc++.h>
#include <atcoder/all>
using namespace atcoder;
using mint = modint1000000007;
using namespace std;
#define rep(i,n) for(int i=0;i<(n);i++)
#define Inf 2000000001

int dis[10001][1<<12];

int main(){
	
	int N,M,K;
	cin>>N>>M>>K;
	
	vector<int> R(K);
	rep(i,K){
		cin>>R[i];
		R[i]--;
	}
	
	vector<int> a(M),b(M),c(M),d(M,0);
	vector<vector<int>> E(N);
	rep(i,M){
		cin>>a[i]>>b[i]>>c[i];
		a[i]--;b[i]--;
		E[a[i]].push_back(i);
		E[b[i]].push_back(i);
	}
	
	rep(i,K){
		d[R[i]] = 1<<i;
	}
	rep(i,N){
		rep(j,1<<K)dis[i][j] = Inf;
	}
	dis[0][0] = 0;
	priority_queue<pair<int,pair<int,int>>,vector<pair<int,pair<int,int>>>,greater<pair<int,pair<int,int>>>> Q;
	Q.emplace(0,make_pair(0,0));
	
	while(Q.size()>0){
		int D = Q.top().first;
		int u = Q.top().second.first;
		int B = Q.top().second.second;
		Q.pop();
		rep(i,E[u].size()){
			int ind = E[u][i];
			int v = u ^ a[ind] ^ b[ind];
			
			int DD = D + c[ind];
			int BB = B | d[ind];
			if(dis[v][BB] > DD){
				dis[v][BB] = DD;
				Q.emplace(DD,make_pair(v,BB));
			}
		}
	}
	cout<<dis[N-1][(1<<K)-1]<<endl;
	
	
	return 0;
}