// Problem: No.2604 Initial Motion
// Contest: yukicoder
// URL: https://yukicoder.me/problems/no/2604
// Memory Limit: 512 MB
// Time Limit: 3000 ms

#include<bits/stdc++.h>
#define debug(x) cerr<<(#x)<<" "<<(x)<<endl
typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;
#define pii pair<ll,ll>
#define rep(i,a,b) for(ll i=(a);i<=(b);++i)
#define per(i,a,b) for(ll i=(a);i>=(b);--i)
using namespace std;
ll read(){
	ll x=0,f=1;char ch=getchar();
	while(ch<'0'||ch>'9'){if(ch=='-')f=-1;ch=getchar();}
	while(ch>='0'&&ch<='9'){x=x*10+ch-'0';ch=getchar();}
	return x*f;
}
void write(ll x){
	if(x<0)putchar('-'),x=-x;
	if(x>9)write(x/10);
	putchar(x%10+'0');
}
const ll N=1e4+5,M=5e6+5,INF=1e14;
ll n,m,S,T,tot=1,hd[N],mxf,mnc,d[N],pre_p[N],pre_e[N],flow[N],in[N];
ll dis[N],ok[N],a[N],b[N],k;
struct Edg{
	ll to,nxt,c,f;
}es[M<<1];
void adde(ll x,ll y,ll c,ll f){
	es[++tot]=(Edg){y,hd[x],c,f};
	hd[x]=tot;
	es[++tot]=(Edg){x,hd[y],-c,0};
	hd[y]=tot;
}
bool spfa(){
	rep(i,0,T)d[i]=flow[i]=INF,in[i]=0;
	queue<ll>q;
	q.push(S);
	d[S]=0,flow[S]=INF,pre_p[T]=-1,in[S]=1;
	while(!q.empty()){
		ll u=q.front();q.pop();
		in[u]=0;
		for(ll i=hd[u];i;i=es[i].nxt){
			ll v=es[i].to,c=es[i].c,f=es[i].f;
			if(f&&d[v]>d[u]+c){
				d[v]=d[u]+c;
				flow[v]=min(flow[u],f);
				pre_p[v]=u,pre_e[v]=i;
				if(!in[v])in[v]=1,q.push(v);
			}
		}
	}
	return pre_p[T]!=-1;
}
void runflow(){
	for(ll x=T;spfa();){
		for(;x!=S;x=pre_p[x])es[pre_e[x]].f-=flow[T],es[pre_e[x]^1].f+=flow[T];
		mxf+=flow[T],mnc+=d[T]*flow[T];
		x=T;
	}
}
vector<pii>to[N];
int main(){
	k=read(),n=read(),m=read();
	rep(i,1,k)a[i]=read();
	rep(i,1,n)b[i]=read();
	rep(i,1,m){
		ll x=read(),y=read(),z=read();
		to[x].push_back(make_pair(y,z));
		to[y].push_back(make_pair(x,z));
	}
	S=0,T=n+k+1;
	rep(i,1,k){
		rep(j,1,n)dis[j]=INF,ok[j]=0;
		dis[a[i]]=0;
		priority_queue<pii>q;
		q.push(make_pair(0,a[i]));
		while(!q.empty()){
			pii now=q.top();q.pop();
			ll u=now.second;
			if(ok[u])continue;
			ok[u]=1;
			for(pii es:to[u]){
				ll v=es.first,w=es.second;
				if(dis[v]>dis[u]+w){
					dis[v]=dis[u]+w;
					q.push(make_pair(-dis[v],v));
				}
			}
		}
		rep(j,1,n){
			if(b[j])adde(i,j+k,dis[j],1);
		}
		adde(S,i,0,1);
	}
	rep(i,1,n){
		if(b[i])adde(i+k,T,0,b[i]);
	}
	runflow();
	write(mnc);
	return 0;
}