#include <iostream> #include <algorithm> using namespace std; int parent[30001]; int find(int u){ if(parent[u] == u) return u; return parent[u] = find(parent[u]); } void merge(int u,int v){ u = find(u); v = find(v); if(u==v) return; else if(u > v) parent[u] = v; else parent[v] = u; } int main(){ int n,m,k,a,b; cin >> n >> m >> k; int candy[30001]; int friend_info[30001]; fill_n(friend_info,friend_info+n,1); for(int i = 1 ; i < n+1; i++){ cin >> candy[i]; parent[i] = i; } for(int i = 1; i < n+1; i++){ cin >> a >> b; merge(a,b); } for(int i = 1; i < n+1; i++){ if(i!=find(i)){ int root = find(i); candy[root] += candy[i]; friend_info[root] += friend_info[i]; } } }