#include<bits/stdc++.h>
using namespace std;
using ll=long long;
template<typename T>
ostream& operator << (ostream &out,const vector<T>&x){
	if(x.empty())return out<<"[]";
	out<<'['<<x[0];
	for(int len=x.size(),i=1;i<len;i++)out<<','<<x[i];
	return out<<']';
}
template<typename T>
vector<T> ary(const T *a,int l,int r){
	return vector<T>{a+l,a+1+r};
}
template<typename T>
void debug(T x){
	cerr<<x<<'\n';
}
template<typename T,typename ...S>
void debug(T x,S ...y){
	cerr<<x<<' ',debug(y...);
}
const int N=1e5+10,M=N*2,V=N*2;
int n,m,k,a[V];
int kk=1,head[N];
struct edges{
	int to,w,nex;
}edge[M*2];
void add(int u,int v,int w){
	edge[++kk]={v,w,head[u]},head[u]=kk;
	edge[++kk]={u,w,head[v]},head[v]=kk;
}
int dft,top,dfn[N],low[N],stk[N],nex[N];
vector<pair<int,int> >to[V];
void adde(int u,int v,int w){
	// debug(u,v,w);
	to[u].push_back({v,w}),to[v].push_back({u,w});
}
void tarjan(int u,int las=0){
	dfn[u]=low[u]=++dft,stk[++top]=u;
	for(int i=head[u];i;i=edge[i].nex){
		if(!(i^las^1))continue;
		int v=edge[i].to,w=edge[i].w;
		if(!dfn[v]){
			tarjan(v,i);
			if(low[v]<low[u])low[u]=low[v],nex[u]=w;
			if(low[v]>dfn[u]){
				for(adde(u,v,w);stk[top--]^v;);
			}else if(low[v]==dfn[u]){
				adde(++m,u,w);
				do adde(m,stk[top],nex[stk[top]]);while(stk[top--]^v);
			}
		}else if(dfn[v]<low[u])low[u]=dfn[v],nex[u]=w;
	}
	// debug("tarjan",u,nex[8]);
}
#define v e.first
#define w e.second
ll ans;
void dfs1(int u,int fa=0){
	for(auto e:to[u])if(v^fa){
		dfs1(v,u);
		a[u]+=a[v];
		if(u<=n&&v<=n)ans+=1ll*w*abs(a[v]);
	}
}
int cnt,b[V],val[V];
ll c[V];
void dfs2(int u,int fa=0){
	for(auto e:to[u])if(v^fa){
		dfs2(v,u);
	}
	if(u>n){
		cnt=0;
		for(auto e:to[u]){
			// debug(v);
			if(v^fa)b[cnt]=a[v],val[cnt++]=w;
			else b[cnt]=-a[u],val[cnt++]=w;
		}
		// debug(ary(b,0,cnt-1),ary(val,0,cnt-1));
		auto calc=[&](int x){
			c[0]=x;
			for(int i=0;i+1<cnt;i++)c[i+1]=c[i]+b[i];
			ll sum=0;
			for(int i=0;i<cnt;i++)sum+=abs(c[i])*val[i];
			return sum;
		};
		int l=-n,r=n,ml,mr;
		for(;l+5<r;){
			ml=(l+l+r)/3,mr=(l+r+r)/3;
			if(calc(ml)>calc(mr))l=ml;
			else r=mr;
		}
		ll res=calc(l);
		for(;++l<=r;)res=min(res,calc(l));
		// debug("res",res);
		ans+=res;
	}
}
#undef v
#undef w
int main(){
	scanf("%d%d%d",&n,&m,&k);
	for(int i=1,x;i<=k;i++)scanf("%d",&x),a[x]++;
	for(int i=1,x;i<=k;i++)scanf("%d",&x),a[x]--;
	// debug(ary(a,1,n));
	for(int u,v,w;m--;){
		scanf("%d%d%d",&u,&v,&w),add(u,v,w);
	}
	m=n,tarjan(1);
	dfs1(1),dfs2(1);
	cout<<ans<<endl;
	return 0;
}