#include <fstream>
#include <vector>
#define MAX 16005
#define oo -2000000
using namespace std;

ifstream in("asmax.in");
ofstream out("asmax.out");

vector <int> V[MAX] ;
int n,Sum[MAX],Val[MAX], Result= oo;
bool viz[MAX];
void Read()
{
    in>>n;
    for(int i=1;i<=n;i++)
        in>>Val[i];
    int x,y;
    while(in>>x>>y)
    {
        V[x].push_back(y);
        V[y].push_back(x);
    }
}
void DFS(int nod)
{
    viz[nod]=true;
    Sum[nod]=Val[nod];
    for(int i=1;i< (int)V[nod].size(); i++)
    {
        int Vecin=V[nod][i];
        if(!viz[Vecin])
        {
            DFS(Vecin);
            Sum[nod] = max(Sum[nod], Sum[nod] + Sum[Vecin]);
        }
    }
    Result=max(Result,Sum[nod]);
}
int main()
{
    Read();
    DFS(1);
    out<<Result;
    return 0;
}