Uj

#include<bits/stdc++.h>
using namespace std;
ifstream in("mere.in");
ofstream out("mere.out");
int a[1001][1001],n,v[1001],c[1001],x,y,sum;
inline void dfs(int r)
{
    register int maxx=0,crt=0;
    sum+=v[r],c[r]=1;
    for(int i=1;i<=n;i++)
        if(!c[i] && a[r][i])
    {
        c[i]=1;
        if(v[i]>maxx)
            maxx=v[i],crt=i;
    }
    if(crt)
        dfs(crt);
}
inline void citire()
{
    in>>n;
    for(int i=1;i<=n;i++)
        in>>v[i];
    while(in>>x>>y)
        a[x][y]=a[y][x]=1;
    dfs(1);
    out<<sum;
}
int main()
{
    citire();
    return 0;
}