#include<iostream>
#include<algorithm>
#include<vector>
using namespace std;
int n,m,k;
int a[1<<17],b[1<<17],c[1<<17];
long sum;
#include<vector>
struct UF{
	int n;
	vector<int>parent,rank;
	UF(int n_=0):n(n_),parent(n_),rank(n_,0)
	{
		for(int i=0;i<n_;i++)parent[i]=i;
	}
	int find(int a)
	{
		return parent[a]!=a?parent[a]=find(parent[a]):a;
	}
	bool same(int a,int b)
	{
		return find(a)==find(b);
	}
	bool unite(int a,int b)
	{
		a=find(a),b=find(b);
		if(a==b)return false;
		if(rank[a]<rank[b])
		{
			parent[a]=b;
		}
		else
		{
			parent[b]=a;
			if(rank[a]==rank[b])rank[a]++;
		}
		return true;
	}
};
main()
{
	cin>>n>>m>>k;
	vector<pair<int,pair<int,int> > >G;
	for(int i=0;i<m;i++)
	{
		cin>>a[i]>>b[i]>>c[i];
		sum+=c[i];
		G.push_back(make_pair(c[i],make_pair(a[i],b[i])));
	}
	UF uf(n+1);
	for(int i=0;i<k;i++)
	{
		int e;cin>>e;
		e--;
		sum-=c[e];
		uf.unite(a[e],b[e]);
	}
	sort(G.begin(),G.end());
	for(int i=0;i<m;i++)
	{
		if(uf.unite(G[i].second.first,G[i].second.second))sum-=G[i].first;
	}
	cout<<sum<<endl;
}