#include<bits/stdc++.h>
using namespace std;
using LL=long long;
#define FOR(i,l,r) for(int i=(l);i<=(r);++i)
#define REP(i,n) FOR(i,0,(n)-1)
#define ssize(x) int(x.size())
template<class A,class B>auto&operator<<(ostream&o,pair<A,B>p){return o<<'('<<p.first<<", "<<p.second<<')';}
template<class T>auto operator<<(ostream&o,T x)->decltype(x.end(),o){o<<'{';int i=0;for(auto e:x)o<<(", ")+2*!i++<<e;return o<<'}';}
#ifdef DEBUG
#define debug(x...) cerr<<"["#x"]: ",[](auto...$){((cerr<<$<<"; "),...);}(x),cerr<<'\n'
#else
#define debug(...) {}
#endif

int main() {
	cin.tie(0)->sync_with_stdio(0);
	int n, m, q;
	cin >> n >> m >> q;
	assert(q == 0);
	assert(m == n - 1);

	vector<int> t(n);
	REP (i, n)
		cin >> t[i];

	LL ans = 0;
	vector<vector<int>> graph(n);
	REP (i, m) {
		int u, v;
		cin >> u >> v;
		--u;
		--v;
		graph[u].emplace_back(v);
		graph[v].emplace_back(u);
		ans += min(t[u], t[v]);
	}

	REP (i, n) {
		int mx = t[i];
		for (int u : graph[i])
			mx = max(mx, t[u]);
		ans += mx - t[i];
	}
	cout << ans << endl;
}