#include<bits/stdc++.h>
# define int long long
# define rep(i, j, k) for (int i = j; i <= k; ++i)
using namespace std;

int n, m, q, s[200005];
int hd[400005], to[400005], nxt[400005], etimer;
int ans, maxx;
void addedge(int u, int v){to[++etimer] = v, nxt[etimer] = hd[u], hd[u] = etimer;}
void dfs(int u, int fa)
{
    for (int i = hd[u]; i; i = nxt[i]) if (to[i] != fa) ans += s[u], dfs(to[i], u);
}

signed main()
{
//	freopen("ex_4.in", "r", stdin);
//	freopen("a.out", "w", stdout);
	ios::sync_with_stdio(false); cin.tie(0), cout.tie(0);
	cin >> n >> m >> q;
	rep(i, 1, n) {cin >> s[i]; if (s[i] > s[maxx]) maxx = s[i];}
	rep(i, 1, m) {int u, v; cin >> u >> v; addedge(u, v), addedge(v, u);}
	dfs(maxx, 0);
	cout << ans << endl;
    return 0;
}