#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(a, b) for(int a = 0; a < (b); ++a)
#define st first
#define nd second
#define pb push_back
#define all(a) a.begin(), a.end()
const int LIM=2e5+7;
ll T[LIM], odw[LIM], ans;
vector<int>V[LIM];
int main() {
	ios_base::sync_with_stdio(0); cin.tie(0);
	int n, m, q;
	cin >> n >> m >> q;
	rep(i, n) cin >> T[i];
	rep(i, m) {
		int a, b;
		cin >> a >> b; --a; --b;
		V[a].pb(b);
		V[b].pb(a);
		ans+=min(T[a], T[b]);
	}
	pair<ll,int>ma={-1, -1};
	rep(i, n) ma=max(ma, {T[i], i});
	priority_queue<pair<ll,ll>>Q;
	Q.push({0, ma.nd});
	while(!Q.empty()) {
		ll o=-Q.top().st, p=Q.top().nd;
		if(odw[p]) continue;
		odw[p]=1;
		ans+=o;
		for(auto i : V[p]) if(!odw[i]) Q.push({-max(T[p]-T[i], 0ll), i});
	}
	cout << ans << '\n';
}