#include <bits/stdc++.h>
using namespace std;
#pragma GCC optimize("O3")
#pragma GCC optimize("Ofast")
#pragma optimize("unroll-loops")
#define fast ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0)
#define all(x) x.begin(), x.end()
#define rll(x) x.rbegin(), x.rend()
#define COMP(x) x.erase(unique(all(x)), x.end())
#define MOD 1000000007
#define MOD2 998244353
#define sz(x) (ll)x.size()
typedef __int128_t lll;
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef pair<ll,ll> pll;
typedef pair<ll, pll> PP;
const ll Lnf = 2e18;
ll n, k, m;
ll dist[5][101010];
vector<ll> imp;
vector<array<ll,2>> adj[101010];
bool chk[101010];
void get_dist(ll x, ll i){
fill(dist[i],dist[i]+101010,Lnf);
dist[i][x] = 0;
priority_queue<array<ll,2>,vector<array<ll,2>>,greater<array<ll,2>>> pq;
pq.push({0,x});
while(sz(pq)){
auto [d,cur] = pq.top(); pq.pop();
if(d!=dist[i][cur])continue;
for(auto [next,w] : adj[cur])if(dist[i][next] > d+w){
dist[i][next] = d+w;
pq.push({d+w,next});
}
}
}
int main(){
fast;
cin>>n>>k>>m;
imp.resize(k);
for(auto &i : imp)cin>>i, chk[i]=1;
if(k>3)return 0;
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 = 0 ; i < k ; i++)get_dist(imp[i],i);
ll ans = Lnf;
for(int i = 1 ; i <= n ; i++)if(!chk[i]){
ll s = 0;
for(int j = 0 ; j < k ; j++)s+=dist[j][i];
ans=min(ans,s);
}
for(int i = 0 ; i < k ; i++){
ll s = 0;
for(int j = 0 ; j < k ; j++)if(i!=j)s+=dist[j][imp[i]];
ans=min(ans,s);
}
cout<<ans;
}
