#include <iostream>
#include <cstdio>
#include <algorithm>
#include <string.h>
#include <vector>
#include <set>
using namespace std;
#define endl '\n'
#define ll long long
#define pi pair<ll, ll>
#define f first
#define s second
ll inf = 0x3f3f3f3f3f3f3f3f;
const int mxn = 1000;
int n, m, k;
int a[mxn];
ll d[mxn][mxn];
vector<pi> g[mxn];
set<pi> pq;
int main(){
ios::sync_with_stdio(0);
cin.tie(0);
cin >> n >> k >> m;
for(int i = 0; i < k; i++){
cin >> a[i];
a[i]--;
}
for(int i = 0; i < m; i++){
int u, v, w;
cin >> u >> v >> w;
u--, v--;
g[u].push_back({v, w});
g[v].push_back({u, w});
}
memset(d, inf, sizeof(d));
for(int s = 0; s < n; s++){
d[s][s] = 0;
pq.insert({0, s});
while(!pq.empty()){
int c = pq.begin()->s;
pq.erase(pq.begin());
for(pi i : g[c]){
if(d[s][c] + i.s < d[s][i.f]){
pq.erase({d[s][c], i.f});
pq.insert({d[s][i.f] = d[s][c] + i.s, i.f});
}
}
}
}
ll ret = inf;
for(int i = 0; i < n; i++)
for(int j = 0; j < n; j++)
for(int l = 0; l < (1 << k); l++){
ll cur = d[i][j];
for(int p = 0; p < k; p++){
cur += d[a[p]][((l >> p) & 1) ? i : j];
}
ret = min(ret, cur);
}
cout << ret << endl;
return 0;
}
