#include<fstream>
#include<iostream>
#include<vector>
using namespace std;
const int nmax = 16000;
int n, m, val[nmax+1],ales,males= 0;
bool viz[nmax+1];
vector<int>a[nmax+1];
    ifstream fin("asmax.in");
    ofstream fout("asmax.out");



    int smax(int nod){
        viz[nod] = 1;
        int s,maxim = val[nod];
        for(int vecin : a[nod])
            if(viz[vecin] == 0){
                s = smax(vecin);
                if(s > 0)maxim += s;
            }
        viz[nod] = 0;
        return maxim;
    }

int main(){
    fin>>n;

    for(int i = 1; i <= n; i++){
        int x;
        fin>>x;
        val[i] = x;
    }
    int x,y;
    while(fin>>x>>y){

    a[x].push_back(y);
    a[y].push_back(x);
    if(a[x].size() > males){
        males = a[x].size();
        ales = x;
    }
    if(a[y].size() > males){
        males = a[y].size();
        ales = y;
    }

    }

    fout<<smax(ales);

}