#include <iostream>
#include <fstream>
#include <algorithm>
#include <vector>
using namespace std;

const int N = 16001;
vector <int> a[N];
int n, m, s[N], v[N];
bool viz[N];

ifstream fin  ("dfs.in" );
ofstream fout ("dfs.out");

void citire ()
{
    fin >> n ;
    for ( int i = 1 ; i <= n ; i++ )
    {
        fin >> v[i];
    }
    int x, y;
    for ( int i = 1 ; i < n ; i++ )
    {
        fin >> x >> y;
        a[x].push_back(y);
        a[y].push_back(x);
    }
    fin.close();
}

void dfs ( int x )
{
    viz[x] = true;
    int y;
    for ( int i = 0 ; i < a[x].size() ; i++ )
    {
        y = a[x][i];
        if ( !viz[y] )
        {
            dfs(y);
            s[x] = max ( s[x] + v[y], v[y] );
        }
        else
        {
            s[x] = v[y];
        }
    }
    s[x] += v[x];
}

int main()
{
    citire();
    dfs(1);
    int ma = 0;
    for ( int i = 1 ; i <= n ; i++ )
    {
    ma = max(ma, s[i]);
    }
    fout << ma;
    return 0;
}