//----------vahagng----------//
#define _CRT_SECURE_NO_WARNINGS
#include <bits/stdc++.h>
// #include <ext/pb_ds/assoc_container.hpp>
using namespace std;
// using namespace __gnu_pbds;
// template <class T> using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
#ifndef ONLINE_JUDGE
#define dbg(x) cerr << #x <<" "; print(x); cerr << endl;
#else
#define dbg(x)
#endif
void print(long long t) { cerr << t; }
void print(int t) { cerr << t; }
void print(string t) { cerr << t; }
void print(char t) { cerr << t; }
void print(double t) { cerr << t; }
void print(long double t) { cerr << t; }
void print(unsigned long long t) { cerr << t; }
template <class T, class V> void print(pair <T, V> p);
template <class T> void print(vector <T> v);
template <class T> void print(set <T> v);
template <class T, class V> void print(map <T, V> v);
template <class T> void print(multiset <T> v);
template <class T, class V> void print(T v[], V n) { cerr << "["; for (int i = 0; i < n; i++) { cerr << v[i] << " "; } cerr << "]"; }
template <class T, class V> void print(pair <T, V> p) { cerr << "{"; print(p.first); cerr << ","; print(p.second); cerr << "}"; }
template <class T> void print(vector <T> v) { cerr << "[ "; for (T i : v) { print(i); cerr << " "; } cerr << "]"; }
template <class T> void print(set <T> v) { cerr << "[ "; for (T i : v) { print(i); cerr << " "; } cerr << "]"; }
template <class T> void print(unordered_set <T> v) { cerr << "[ "; for (T i : v) { print(i); cerr << " "; } cerr << "]"; }
template <class T> void print(multiset <T> v) { cerr << "[ "; for (T i : v) { print(i); cerr << " "; } cerr << "]"; }
template <class T, class V> void print(map <T, V> v) { cerr << "[ "; for (auto i : v) { print(i); cerr << " "; } cerr << "]"; }
#define ll long long
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
#define ld long double
#define sz(v) v.size()
#define endl '\n'
const ll inf = 2e18, mod = 1e9 + 7, mod2 = 998244353, mod3 = 1e9 + 9;
void SetIO(string str = "") {
if (str != "") {
freopen((str + ".in").c_str(), "r", stdin);
freopen((str + ".out").c_str(), "w", stdout);
}
else {
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
}
}
void FastIO() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
cout.tie(nullptr);
}
const int N = 3e5 + 10, M = 2e7 + 10;
mt19937 rnd(chrono::system_clock::now().time_since_epoch().count());
ll binpow(ll a, ll b, ll m) {
ll res = 1;
while (b) {
if (b & 1) {
res = (res * a) % m;
}
b >>= 1;
a = (a * a) % m;
}
return res;
}
__int128_t gcd(__int128_t a, __int128_t b) {
while (b) {
a %= b;
swap(a, b);
}
return a;
}
__int128_t lcm(__int128_t a, __int128_t b) {
return a / gcd(a, b) * b;
}
int n, k, m, a[N], parr[N], kox_id[N];
vector<pair<int, pair<ll, int>>> adj[N];
ll dist[N];
struct DSU {
int sz[N], par[N];
void init() {
for (int i = 1; i <= n; i++) {
sz[i] = 1;
par[i] = i;
}
}
int find(int a) {
if (par[a] == a) return par[a];
return par[a] = find(par[a]);
}
bool merge(int a, int b) {
a = find(a), b = find(b);
if (a == b) return 0;
if (sz[a] > sz[b]) swap(a, b);
sz[b] += sz[a];
par[a] = b;
return 1;
}
} dsu;
void dfs(int node, int parent) {
for (auto [u, W] : adj[node]) {
if (u == parent) continue;
auto [w, id] = W;
kox_id[u] = id;
parr[u] = node;
dist[u] = dist[node] + w;
dfs(u, node);
}
}
bool marked[N];
void solve(int tc) {
cin >> n >> k >> m;
for (int i = 1; i <= k; i++) cin >> a[i];
vector<pair<ll, pair<int, int>>> edges;
for (int i = 0; i < m; i++) {
int u, v;
ll w;
cin >> u >> v >> w;
edges.push_back({ w, {u, v} });
}
sort(all(edges));
dsu.init();
int comps = n;
int id = 0;
vector<ll> V;
for (auto [W, kogh] : edges) {
auto [u, v] = kogh;
if (dsu.merge(u, v)) {
comps--;
adj[u].push_back({ v, {W, id} });
adj[v].push_back({ u, {W, id} });
id++;
V.push_back(W);
}
if (comps == 1) break;
}
dfs(a[1], 0);
ll ans = 0;
for (int i = 2; i <= k; i++) {
int cur = a[i];
while (cur != a[1]) {
// dbg(cur);
marked[kox_id[cur]] = 1;
cur = parr[cur];
}
}
for (int i = 0; i < id; i++) {
if (marked[i]) ans += V[i];
}
cout << ans << endl;
}
void precalc() {
}
int main() {
// SetIO("teamwork");
FastIO();
int test_case = 1;
// cin >> test_case;
precalc();
int cnt = 1;
while (test_case--) {
solve(cnt++);
}
return 0;
}
