#include<bits/stdc++.h>
#define Gc() getchar()
#define Me(x,y) memset(x,y,sizeof(x))
#define Mc(x,y) memcpy(x,y,sizeof(x))
#define d(x,y) ((m)*(x-1)+(y))
#define R(n) (rnd()%(n)+1)
#define Pc(x) putchar(x)
#define LB lower_bound
#define UB upper_bound
#define fi first
#define se second
#define eb emplace_back
#define all(x) x.begin(),x.end()
using namespace std;using ll=long long;using db=double;using lb=long db;using ui=unsigned;using ull=unsigned long long;using pii=pair<int,int>;
const int N=2e5+5,M=N*4+5,K=1000+5,mod=998244353,Mod=mod-1;const db eps=1e-9;const int INF=1e9+7;mt19937 rnd(28382);
#define Tp template<typename T>
#define Ts template<typename T,typename... Ar>
namespace Debug{
	Tp void _debug(char* f,T t){cerr<<f<<'='<<t<<endl;}
	Ts void _debug(char* f,T x,Ar... y){while(*f!=',') cerr<<*f++;cerr<<'='<<x<<",";_debug(f+1,y...);}
	#ifdef LOCAL
	#define gdb(...) _debug((char*)#__VA_ARGS__,__VA_ARGS__)
	#else 
	#define gdb(...) void()
	#endif
}using namespace Debug;
int n,m,Q,A[N],id[N];
vector<int> S[N];
int fa[N];
ll w[N];
int GF(int x){
	if(x==fa[x]) return x;
	int v=GF(fa[x]);
	w[x]+=w[fa[x]];
	return fa[x]=v;
}
void Solve(){
	scanf("%d%d%d",&n,&m,&Q);
	for(int i=1;i<=n;i++) scanf("%d",&A[i]);
	ll ans=0;
	while(m--){
		int x,y;scanf("%d%d",&x,&y);
		S[x].push_back(y);S[y].push_back(x);
		ans+=min(A[x],A[y]);
	}
	int cnt=0;for(int i=1;i<=n;i++) cnt+=(A[i]==1);
	for(int i=1;i<=n;i++) for(int j:S[i]) if(i<j&&A[i]==1&&A[j]==1) cnt--;
	gdb(cnt,ans);
	iota(fa+1,fa+n+1,1);
	iota(id+1,id+n+1,1);
	sort(id+1,id+n+1,[](int x,int y){return A[x]<A[y];});
	for(int i=1;i<=n;i++){
		int x=id[i];
		for(int j:S[x]) if(make_pair(A[j],j)<make_pair(A[x],x)){
			int v=GF(j);
			ll res=A[x]-A[j]-(w[j]+w[v]);
			if(res) assert(A[v]==1);
			ans+=max(res,0ll);w[v]+=max(res,0ll);w[x]+=max(-res,0ll);
			fa[v]=x;
		}
	}
	printf("%lld\n",ans);
}
int main(){
	int t=1;
	// scanf("%d",&t);
	while(t--) Solve();
	cerr<<clock()*1.0/CLOCKS_PER_SEC<<'\n';
}