#define  _CRT_SECURE_NO_WARNINGS
#include <stdio.h>
#include <algorithm>
#include <utility>
#include <functional>
#include <cstring>
#include <queue>
#include <stack>
#include <math.h>
#include <iterator>
#include <vector>
#include <string>
#include <set>
#include <math.h>
#include <iostream>
#include <random>
#include<map>
#include <iomanip>
#include <time.h>
#include <stdlib.h>
#include <list>
#include <typeinfo>
#include <list>
#include <set>
#include <cassert>
#include<fstream>
#include <unordered_map>
#include <cstdlib>
using namespace std;
#define Ma_PI 3.141592653589793
#define eps 0.00000001
#define LONG_INF 3000000000000000000
#define GOLD 1.61803398874989484820458
#define MAX_MOD 1000000007
#define MOD 998244353
#define REP(i,n) for(long long i = 0;i < n;++i)    
#define seg_size 524288
long long union_find[200000] = {};
int union_search(int k) {
	if (union_find[k] == k) return k;
	return union_find[k] = union_search(union_find[k]);
}
int union_merge(int a, int b) {
	a = union_search(a);
	b = union_search(b);
	union_find[a] = b;
	return 0;
}
int main() {
	int n, m, k;
	cin >> n >> m >> k;
	vector<tuple<int, int, int>> edges;
	long long ans = 0;
	REP(i, m) {
		long long a, b, c;
		cin >> a >> b >> c;
		ans += c;
		edges.push_back(make_tuple(c, a, b));
	}
	REP(i, n) {
		union_find[i] = i;
	}
	REP(i, k) {
		int a;
		cin >> a;
		a--;
		ans -= get<0>(edges[a]);
		union_merge(get<1>(edges[a]), get<2>(edges[a]));
	}
	sort(edges.begin(), edges.end());
	REP(i, m) {
		int a = get<1>(edges[i]);
		int b = get<2>(edges[i]);
		if (union_search(a) != union_search(b)) {
			union_merge(a, b);
			ans -= get<0>(edges[i]);
		}
	}
	cout << ans << endl;
	return 0;
}