#include "bits/stdc++.h"
using namespace std;
typedef long long ll;
#define INF (1<<30)
#define INFLL (1ll<<60)
typedef pair<ll, int> P;
typedef pair<ll, P> E;
#define MOD (1000000007ll)
#define l_ength size

void mul_mod(ll& a, ll b){
	a *= b;
	a %= MOD;
}

void add_mod(ll& a, ll b){
	b += MOD;
	a += b;
	a %= MOD;
}

int ufp[100100],ufr[100100],a[100100],b[100100];
ll c[100100];
bool f[100100];
vector<P> v;

void ufinit(int n){
	int i;
	for(i=0; i<n; ++i){
		ufp[i] = i;
		ufr[i] = 0;
	}
}

int ufind(int x){
	if(ufp[x]!=x){
		ufp[x] = ufind(ufp[x]);
	}
	return ufp[x];
}

void unionf(int x, int y){
	x = ufind(x);
	y = ufind(y);
	if(x==y){
		return;
	}
	if(ufr[x] > ufr[y]){
		ufp[y] = x;
	}else{
		ufp[x] = y;
		if(ufr[x]==ufr[y]){
			++ufr[y];
		}
	}
}

bool comp(P a, P b){
	return (a.first<b.first);
}

int main(void){
	int n,m,k,e,i;
	ll ans=0ll;
	fill(f,f+100100,false);
	cin >> n >> m >> k;
	ufinit(n);
	for(i=0; i<m; ++i){
		cin >> a[i] >> b[i] >> c[i];
		--a[i]; --b[i];
		v.push_back(P(c[i],i));
	}
	sort(v.begin(),v.end(),comp);
	for(i=0; i<k; ++i){
		cin >> e;
		--e;
		f[e] = true;
		unionf(a[e],b[e]);
	}
	for(i=0; i<m; ++i){
		e = v[i].second;
		if(f[e]){
			continue;
		}
		if(ufind(a[e]) == ufind(b[e])){
			ans += c[e];
			continue;
		}
		unionf(a[e],b[e]);
	}
	cout << ans << endl;
	return 0;
}