#include <bits/stdc++.h>
using namespace std;

const int INF = 1 << 26;
struct Edge {
	int u, v, c;
	bool operator<(const Edge& other) const {
		return c < other.c;
	}
};

int N, M, T, ts[50];
Edge E[777];
int dist[50][50];

int root[50];
inline int find(int x){
	if(x == root[x])return x;
	return root[x] = find(root[x]);
}
inline bool conn(int x, int y){
	x = find(x);
	y = find(y);
	if(x == y)return false;

	root[x] = y;
	return true;
}


int rest_v[50], use_rest[50];
int use[50];
inline int min_spanning_tree(int now){
	for(int i=0;i<N;i++)root[i] = i;

	int res = 0;
	for(int i=0;i<M;i++){
		int u = E[i].u, v = E[i].v, c = E[i].c;
		if(!use[u] || !use[v])continue;
		if(conn(u, v)){
			res += c;
			if(res >= now)break;
		}
	}

	if(res >= now)return INF;

	for(int i=0;i<T;i++){
		if(find(ts[i]) != find(ts[0]))return INF;
	}

	return res;
}

int main(){
	clock_t start = clock();

	cin >> N >> M >> T;
	for(int i=0;i<M;i++){
		int u, v, c;
		cin >> u >> v >> c;
		E[i] = Edge{u - 1, v - 1, c};
	}
	for(int i=0;i<T;i++)cin >> ts[i], ts[i]--;

	int res = INF;
	for(int i=0;i<T;i++)use[ts[i]] = true;

	int rest = 0;
	for(int i=0;i<N;i++)if(!use[i]){
		rest_v[rest++] = i;
	}

	sort(E, E + M);
	
	while(clock() - start <= 4.7 * CLOCKS_PER_SEC){
		int sz = 0;
		for(int i=0;i<rest;i++){
			if(rand() & 1){
				use[rest_v[i]] = true;
				use_rest[sz++] = rest_v[i];
			}
		}

		res = min(res, min_spanning_tree(res));

		for(int i=0;i<sz;i++){
			use[use_rest[i]] = false;
		}
	}

	cout << res << endl;
	return 0;
}