#include <bits/stdc++.h>
typedef long long i64;
using std::cout;
using std::endl;
using std::cin;

struct UnionFind {
	std::vector<int> data;
	
	UnionFind(int n) {
		data.assign(n, -1);
	}
	
	bool unite(int x, int y) {
		x = find(x); y = find(y);
		if(x == y) return false;
		if(data[x] > data[y]) std::swap(x, y);
		data[x] += data[y];
		data[y] = x;
		return true;
	}
	
	int find(int k) {
		if(data[k] < 0) return k;
		return data[k] = find(data[k]);
	}
};

int main() {
	int n, m, k; scanf("%d %d %d", &n, &m, &k);
	std::vector<int> a(m), b(m), c(m);
	std::vector<std::pair<int, int>> vec;
	i64 sum = 0;
	for(int i = 0; i < m; i++) {
		scanf("%d %d %d", &a[i], &b[i], &c[i]); a[i]--; b[i]--;
		
		sum += c[i];
		vec.push_back({c[i], i});
	}
	sort(begin(vec), end(vec));
	
	i64 ans = 0;
	UnionFind uf(n);
	for(int i = 0; i < k; i++) {
		int p; scanf("%d", &p); p--;
		
		uf.unite(a[p], b[p]);
		ans += c[p];
	}
	
	for(auto v : vec) {
		auto p = v.second;
		if(uf.unite(a[p], b[p])) ans += c[p];
	}
	
	printf("%lld\n", sum - ans);
	return 0;
}