#include <bits/stdc++.h>
using namespace std;
#define nyahalo ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define otsumiko exit(0);
#define mikodanye priority_queue<pair<long long, long long>, vector<pair<long long, long long> >, greater<pair<long long, long long> > >
#define mikochi priority_queue<long long, vector<long long>, greater<long long> >
long long n, k, m, u, v, c, tl[6], tp[100069], pw[22], pr[100069], ci, ctu, ans = 1e17, cst;
pair<long long, pair<long long, long long> > ed[100069];
set<long long> st;
long long fd(long long x) {
if (pr[x] != x) {
pr[x] = fd(pr[x]);
}
return pr[x];
}
int main() {
nyahalo
long long i, j, ii;
pw[0] = 1;
for (i=1; i<=21; i++) {
pw[i] = pw[i-1]*2;
}
cin >> n >> k >> m;
for (i=1; i<=n; i++) {
tp[i] = 0;
pr[i] = i;
}
for (i=1; i<=k; i++) {
cin >> tl[i];
tp[tl[i]] = 1;
}
for (i=1; i<=m; i++) {
cin >> ed[i].second.first >> ed[i].second.second >> ed[i].first;
}
sort(ed+1, ed+m+1);
if (n<=20 && m<=40) {
for (i=0; i<=pw[n]-1; i++) {
ctu = 0;
for (j=1; j<=k; j++) {
ci = tl[j];
if ((i&pw[ci-1]) == 0) {
ctu = 1;
break;
}
}
if (ctu == 1) {
continue;
}
for (j=1; j<=n; j++) {
pr[j] = j;
}
cst = 0;
for (j=1; j<=m; j++) {
c = ed[j].first;
u = ed[j].second.first;
v = ed[j].second.second;
if ((i&pw[u-1]) == 0 || (i&pw[v-1]) == 0) {
continue;
}
if (fd(u) != fd(v)) {
cst += c;
pr[fd(u)] = fd(v);
}
}
for (j=1; j<=n; j++) {
if ((i&pw[j-1]) == 0) {
continue;
}
st.insert(fd(j));
}
if (st.size()>1) {
cst = 1e17;
}
st.clear();
ans = min(ans, cst);
}
cout << ans << "\n";
otsumiko
}
cout << "sek\n";
otsumiko
}
