#include <bits/stdc++.h>
#include <atcoder/all>
using namespace std;
using namespace atcoder;
//using mint = modint1000000007;
//const int mod = 1000000007;
//using mint = modint998244353;
//const int mod = 998244353;
//const int INF = 1e9;
//const long long LINF = 1e18;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep2(i,l,r)for(int i=(l);i<(r);++i)
#define rrep(i, n) for (int i = (n-1); i >= 0; --i)
#define rrep2(i,l,r)for(int i=(r-1);i>=(l);--i)
#define all(x) (x).begin(),(x).end()
#define allR(x) (x).rbegin(),(x).rend()
#define endl "\n"
#define P pair<int,int>
template<typename A, typename B> inline bool chmax(A & a, const B & b) { if (a < b) { a = b; return true; } return false; }
template<typename A, typename B> inline bool chmin(A & a, const B & b) { if (a > b) { a = b; return true; } return false; }

int main() {
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	int n, m, k; cin >> n >> m >> k;
	vector<pair<int, P>>v(m);
	rep(i, m) {

		cin >> v[i].second.first >> v[i].second.second >> v[i].first;
		v[i].second.first--;
		v[i].second.second--;
	}
	dsu uf(n);
	rep(i, k) {
		int e; cin >> e; e--;
		uf.merge(v[e].second.first, v[e].second.second);
		v[e].first = 0;
	}
	sort(all(v));
	long long ans = 0;
	rep(i, v.size()) {
		if (!uf.same(v[i].second.first,v[i].second.second)) {
			uf.merge(v[i].second.first,v[i].second.second);
		}
		else {
			ans += v[i].first;
		}
	}
	cout << ans << endl;
	return 0;
}