#include<bits/stdc++.h>
#define st first
#define nd second
#define pb push_back
#define eb emplace_back
#define pp pop_back
#define mp make_pair
#define all(x) (x).begin(), (x).end()
using namespace std;
using vi = vector<int>;
using pii = pair<int, int>;
using vii = vector<pii>;
using ll = long long;
mt19937 rng(chrono::high_resolution_clock::now().time_since_epoch().count());
const int N=2e5+5;
vi E[N];
int tab[N];
int r[N];
int find(int v){
	if(v==r[v])return v;
	return r[v]=find(r[v]);
}
int main(){
	int n, m, q;
	cin>>n>>m>>q;
	ll sum=0;
	int ma=0;
	for(int i=1; i<=n; i++){
		cin>>tab[i];
		r[i]=i;
		sum-=tab[i];
		ma=max(ma, tab[i]);
	}
	vector<pair<int, pii> > V;
	for(int i=0; i<m; i++){
		int u, v;
		cin>>u>>v;
		E[u].pb(v);
		E[v].pb(u);
		V.eb(tab[u]+tab[v], mp(u, v));
	}
	sort(all(V));
	for(int i=0; i<m; i++){
		int c=V[i].st;
		int u=V[i].nd.st, v=V[i].nd.nd;
		u=find(u);
		v=find(v);
		if(u!=v){
			r[u]=v;
			sum+=c;
		}
	}
	cout<<sum+ma;
}