#include <iostream>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <string>
#include <iomanip>
#include <algorithm>
#include <cmath>
#include <stdio.h>
using namespace std;
#define int long long
int MOD = 1000000007;
struct UnionFind {
	vector<int> data;
	UnionFind(int size) : data(size, -1) { }
	bool unionSet(int x, int y) {
		x = root(x); y = root(y);
		if (x != y) {
			if (data[y] < data[x]) swap(x, y);
			data[x] += data[y]; data[y] = x;
		}
		return x != y;
	}
	bool findSet(int x, int y) {
		return root(x) == root(y);
	}
	int root(int x) {
		return data[x] < 0 ? x : data[x] = root(data[x]);
	}
	int size(int x) {
		return -data[root(x)];
	}
};
struct E {
	int a, b, c;
	bool operator<(const E &right) const {
		return c < right.c;
	}
};
signed main() {
	cin.tie(0);
	ios::sync_with_stdio(false);
	int N, M, K;
	cin >> N >> M >> K;
	int a, b, c;
	vector<E> es;
	int sum = 0;
	for (int i = 0; i < M; i++) {
		cin >> a >> b >> c;
		sum += c;
		a--; b--;
		es.push_back(E{ a,b,c });
	}
	UnionFind uf(N);
	for (int i = 0; i < K; i++) {
		cin >> a;
		a--;
		sum -= es[a].c;
		es[a].c = 0;
	}
	sort(es.begin(), es.end());
	for (int i = 0; i < es.size(); i++) {
		if (!uf.findSet(es[i].a, es[i].b)) {
			uf.unionSet(es[i].a, es[i].b);
			sum -= es[i].c;
		}
	}
	cout << sum << endl;
}