#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const int N = 1e5+10, K = 5;
ll dist[1<<K][N];
vector<pair<int, ll>> adj[N];
int main(){
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
int n, k, m;
cin >> n >> k >> m;
memset(dist, 0x3f, sizeof dist);
for(int i = 0; i < k; ++i){
int u;
cin >> u;
dist[1<<i][u] = 0;
}
while(m--){
int u, v, w;
cin >> u >> v >> w;
adj[u].push_back({v, w});
adj[v].push_back({u, w});
}
for(int mask = 1; mask < (1<<k); ++mask){
for(int i = 0; i < k; ++i){
if(!(mask&(1<<i))) continue;
for(int j = 1; j <= n; ++j){
dist[mask][j] = min(dist[mask][j], dist[mask^(1<<i)][j] + dist[1<<i][j]);
}
}
priority_queue<pair<ll, int>, vector<pair<ll, int>>, greater<pair<ll, int>>> pq;
for(int i = 1; i <= n; ++i) pq.push({dist[mask][i], i});
while(!pq.empty()){
auto [d, u] = pq.top(); pq.pop();
if(dist[mask][u] < d) continue;
for(auto [v, w] : adj[u]){
if(dist[mask][v] > d+w){
pq.push({dist[mask][v] = d+w, v});
}
}
}
}
ll ans = 2e18;
for(int i = 1; i <= n; ++i) ans = min(ans, dist[(1<<k)-1][i]);
cout << ans << '\n';
}
