/*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 distra(int s){ int z=a[s]; for(int i=1;i<=n;i++) d[s][i]=mod; d[s][z]=0; priority_queue <ii,vector<ii>,greater<ii> > pq; pq.push({0,z}); while(pq.size()){ ll du=pq.top().fi,u=pq.top().se; pq.pop(); if(du!=d[s][u]) continue; for(auto x:adj[u]){ ll dv=x.fi+du,v=x.se; if(dv<d[s][v]){ d[s][v]=dv; pq.push({dv,v}); } } } } namespace sub1{ void solve(){ ll ans=mod; for(int i=1;i<=n;i++){ ll res=0; for(int j=1;j<=k;j++) { //if(j==i) continue; res+=d[j][i]; } ans=min(ans,res); } cout<<ans; } } void distra2(){ ans=mod; for(int i=1;i<=n;i++){ for(int j=1;j<(1<<k);j++) dp[i][j]=mod; } priority_queue <pair<ll,ii> ,vector < pair<ll,ii> >,greater <pair<ll,ii> > > pq; for(int i=1;i<=k;i++){ dp[a[i]][(1<<(i-1))]=0; pq.push({dp[a[i]][(1<<(i-1))],{a[i],(1<<(i-1))}}); } while(pq.size()){ ll du=pq.top().fi,u=pq.top().se.fi,x=pq.top().se.se; pq.pop(); if(dp[u][x]!=du) continue; if(x==(1<<k)-1) ans=min(ans,du); for(ii z:adj[u]){ ll w=z.fi,v=z.se; for(int j=0;j<(1<<k);j++){ ll dv=dp[v][j]+du+w,y=(j|x); if(dp[v][y]>dv){ dp[v][y]=dv; pq.push({dv,{v,y}}); } } } } } 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); } for(int i=1;i<=k;i++){ distra(i); } // 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; }