/*DEP TRAI CO J SAI*/ #include <bits/stdc++.h> using namespace std; #define fi first #define se second #define pu emplace_back #define ll long long typedef pair <ll,ll> ii; const int N=2e5; long long mod=1e17; ll n,m,k,y; ll a[N+1],b[N+1],d[10][N+10],dp[N+10][(1<<6)],ans; void add(int &a,int b){ a+=b; if(a>=mod) a-=mod; } vector <ii> adj[N+10]; void distra2(){ ans=mod; for(int i=1;i<=n;i++){ for(int j=1;j<(1<<k);j++) dp[i][j]=mod; } for(int i=1;i<=k;i++){ dp[a[i]][(1<<(i-1))]=0; } for(int ma=1;ma<(1<<k);++ma){ priority_queue <ii ,vector < ii >,greater <ii > > pq; for(int sub=ma;sub>0;sub=((sub-1)&ma)){ int t=(ma^sub); for(int i=1;i<=n;i++){ dp[i][ma]=min(dp[i][ma],dp[i][t]+dp[i][sub]); } } for(int i=1;i<=n;i++){ if(dp[i][ma]!=mod){ pq.push({dp[i][ma],i}); if(ma==((i<<k)-1)) ans=min(ans,dp[i][ma]); } } while(pq.size()){ ll du=pq.top().fi,u=pq.top().se; pq.pop(); if(dp[u][ma]!=du) continue; for(ii z:adj[u]){ ll dv=du+z.fi,v=z.se; if(dp[v][ma]>dv){ dp[v][ma]=dv; pq.push({dv,v}); } } } } } void tinh(){ cin>>n>>k>>m; for(int i=1;i<=k;i++) cin>>a[i]; for(int i=1;i<=m;i++){ int u,v,w; cin>>u>>v>>w; adj[u].pu(w,v); adj[v].pu(w,u); } ans=mod; // if(k<=3){ // sub1::solve(); // return; // } distra2(); cout<<ans; } int main(){ ios_base::sync_with_stdio(false); // freopen("cities.inp","r",stdin); //freopen("cities.out","w",stdout); cin.tie(0); cout.tie(0); tinh(); return 0; }