#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
#include<algorithm>
#include<functional>
#include<vector>
#include<queue>
#include<stack>
#include<set>
using namespace std;
#define MOD 1000000007
#define f(i,n) for(int i=0;i<int(n);i++)
#define N 200000

int p[N];
int d[N];

void init(void){
	f(i, N){
		p[i] = i;
		d[i] = 1;
	}
	return;
}

int pa(int x){
	if (p[x] == x)return x;
	else return p[x] = pa(p[x]);
}


void uni(int x, int y){
	int px = pa(x);
	int py = pa(y);
	if (px == py)return;
	if (d[px] < d[py]){
		p[px] = py;
		d[py] = max(d[py], d[px] + 1);
	}
	else{
		p[py] = px;
		d[px] = max(d[px], d[py] + 1);
	}
	return;
}

bool jud(int x, int y){
	int px = pa(x);
	int py = pa(y);
	if (px == py)return true;
	else return false;
}


int main(){
	int n,m,k;
	int x, y, z;
	int a[N];
	int b[N];
	long long c[N];
	bool used[N];
	long long s, ans;
	bool v = true;
	vector < pair<long long, pair<int, int> > >pe;
	ans = 0;
	init();
	scanf("%d %d %d", &n, &m, &k);
	f(i, m){
		scanf("%d %d %lld", &a[i], &b[i], &c[i]);
		a[i]--;
		b[i]--;
		used[i] = false;
	}
	f(i, k){
		scanf("%d", &x);
		x--;
		used[x] = true;
		uni(a[x], b[x]);
	}
	f(i, m){
		if (!used[i]){
			pe.push_back(make_pair(c[i], make_pair(a[i], b[i])));
		}
	}
	sort(pe.begin(), pe.end());
	f(i, pe.size()){
		if (jud(pe[i].second.first, pe[i].second.second)){
			ans += pe[i].first;
		}
		else{
			uni(pe[i].second.first, pe[i].second.second);
		}
	}
	printf("%lld\n", ans);


	return 0;
}