#pragma GCC optimize("Ofast","O3","unroll-loops")
#pragma GCC target("avx","avx2")
#include <bits/stdc++.h>
using namespace std;
#define LCBorz ios_base::sync_with_stdio(false); cin.tie(0);
#define ll long long
#define all(x) x.begin(), x.end()
#define endl '\n'
const int N=200005;
const ll INF=1e18;
int n,k,m;
vector<int> s;
vector<pair<int,ll>> adj[N];
vector dis(32,vector<ll>(N,INF));
vector dis1(5,vector<ll>(N,INF));
void dijk(int s,vector<ll> &dis){
priority_queue<pair<ll,int>> pq;
if(s!=-1){
dis[s]=0;
}
for(int i=1;i<=n;i++){
pq.push({-dis[i],i});
}
while(pq.size()){
auto [dis1,a]=pq.top();
pq.pop();
dis1=-dis1;
if(dis1!=dis[a])continue;
for(auto [c,d]:adj[a]){
ll cost=dis1+d;
if(dis[c]>cost){
dis[c]=cost;
pq.push({-dis[c],c});
}
}
}
}
int32_t main() {
LCBorz;
cin>>n>>k>>m;
for(int i=0;i<k;i++){
int p;cin>>p;
s.push_back(p);
}
for(int i=0;i<m;i++){
ll a,b,c;cin>>a>>b>>c;
adj[a].push_back({b,c});
adj[b].push_back({a,c});
}
for(int i=1;i<=n;i++){
dis[0][i]=0;
}
for(int i=0;i<k;i++){
dijk(s[i],dis1[i]);
}
for(int mask=1;mask<(1<<k);mask++){
for(int j=0;j<k;j++){
if(mask&(1<<j)){
for(int i=1;i<=n;i++){
dis[mask][i]=min(dis[mask][i],dis[mask^(1<<j)][i]+dis1[j][i]);
}
}
}
dijk(-1,dis[mask]);
}
ll ans=INF;
for(int i=1;i<=n;i++){
ans=min(ans,dis[(1<<k)-1][i]);
}
cout<<ans<<endl;
return 0;
}
