#include <cstdio>
#include <algorithm>
#include <cstring>
#include <vector>
#define inf -1000000002
#define Nmax 16002
using namespace std;
int n, i, j, k, x, y, v[Nmax], sol, viz[Nmax], s;
vector < int > V[Nmax];
int sum[Nmax];
int dfs(int x, int s)
{
    int S = 0;
    if (sum[x] != inf)
        return sum[x];
    for (int i = 0; i < V[x].size(); ++ i)
        if (viz[V[x][i]] != k)
    {
        viz[V[x][i]] = k;
        S = dfs(V[x][i], v[V[x][i]]);
        if (S > 0)
            s += S;
        else viz[V[x][i]] = 0;
    }
    sum[x] = s;
    return s;
}
void read()
{
    scanf("%d", &n);
    for (i = 1; i <= n; ++ i)
        scanf("%d", &v[i]),
        sum[i] = inf;
    for (i = 1; i < n; ++ i)
    {
        scanf("%d %d", &x, &y);
        V[x].push_back(y);
        V[y].push_back(x);
    }
}
void solve()
{
    sol = inf;
    for (i = 1; i <= n; ++ i)
    {
        k = i;
        viz[i] = k;
        sum[i] = dfs(i, v[i]);
        if (sum[i] > sol)
            sol = sum[i];

    }
}
int main()
{
    freopen("asmax.in", "r", stdin);
    freopen("asmax.out", "w", stdout);
    read();
    solve();
    printf("%d", sol);
    return 0;
}