#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
struct Edge{
	int x,y,z,id;
}e[300005],te[55],ee[55];
struct E{
	int to,id;
};
int n,m,K,fa[100005],isrep[300005],a[100005],F[100005],fv[100005];
int d[100005],ts,bel[100005],cnt,M,nd[300005];
ll sz[100005],val[100005],ans=0,sum=0;
vector<E> g[100005],G[100005];
int gf(int x){
	return x==fa[x]?x:fa[x]=gf(fa[x]);
}
void dfs1(int x,int fa){
	if(x==ee[fa].x)F[x]=ee[fa].y;
	else F[x]=ee[fa].x;
	fv[x]=fa,d[x]=d[F[x]]+1;
	for(E i:G[x]){
		int y=i.to;
		if(y==F[x])continue;
		dfs1(y,i.id);
	}
}
void Get(int x,int y,int z){
	int mx=0,tx=x,ty=y;
	while(x!=y){
		if(d[x]<d[y])swap(x,y);
		ee[fv[x]].z=min(ee[fv[x]].z,z),x=F[x];
	}
}
void dfs2(int x,int fa){
	val[cnt]+=a[x],bel[x]=cnt;
	for(E i:g[x]){
		int y=i.to;
		if(y==fa)continue;
		dfs2(y,x);
	}
}
void dfs3(int x,int fa){
	sz[x]=val[x];
	for(E i:G[x]){
		int y=i.to;
		if(y==fa)continue;
		dfs3(y,x),sz[x]+=sz[y];
		if(ee[i.id].id<=K)sum+=1ll*ee[i.id].z*sz[y];
	}
}
ll Calc(){
	for(int i=1;i<=cnt;i++)fa[i]=i,G[i].clear();
	for(int i=1;i<=M;i++){
		int x=gf(ee[i].x),y=gf(ee[i].y);
		if(x==y){
			nd[i]=1;
			continue;
		}
		fa[x]=y,G[ee[i].x].push_back({ee[i].y,i}),G[ee[i].y].push_back({ee[i].x,i});
		if(!ee[i].z)ee[i].z=1e9;
	}
	sum=0,dfs1(bel[1],0);
	for(int i=1;i<=M;i++)if(nd[i])Get(ee[i].x,ee[i].y,ee[i].z),nd[i]=0;
	dfs3(bel[1],0);
	return sum;
}
int main(){
	scanf("%d%d%d",&n,&m,&K);
	for(int i=1,x,y,z;i<=m;i++)scanf("%d%d%d",&x,&y,&z),e[i]={x,y,z,i};
	for(int i=1;i<=n;i++)fa[i]=i;
	for(int i=1,x,y,z;i<=K;i++){
		scanf("%d%d",&x,&y),te[++ts]={x,y,0};
		x=gf(x),y=gf(y),fa[x]=y;
	}
	sort(e+1,e+m+1,[](Edge x,Edge y){return x.z<y.z;});
	for(int i=1;i<=m;i++){
		int x=gf(e[i].x),y=gf(e[i].y);
		if(x==y)continue;
		fa[x]=y,g[e[i].x].push_back({e[i].y,i}),g[e[i].y].push_back({e[i].x,i});
	}
	for(int i=1;i<=n;i++)scanf("%d",&a[i]);
	for(int i=1;i<=n;i++){
		if(bel[i])continue;
		cnt++,dfs2(i,0);
	}
	for(int i=1;i<=K;i++)te[i].x=bel[te[i].x],te[i].y=bel[te[i].y];
	for(int i=1;i<=m;i++)e[i].x=bel[e[i].x],e[i].y=bel[e[i].y];
	for(int i=1;i<=cnt;i++)fa[i]=i;
	for(int i=1;i<=m;i++){
		int x=gf(e[i].x),y=gf(e[i].y);
		if(x==y)continue;
		fa[x]=y,te[++ts]=e[i],te[ts].id=ts;
	}
	for(int i=0;i<(1<<K);i++){
		M=0;
		for(int j=1;j<=K;j++)if(i&(1<<j-1))ee[++M]=te[j];
		for(int j=K+1;j<=ts;j++)ee[++M]=te[j];
		ans=max(ans,Calc());
	}
	cout<<ans;
}