#include <bits/stdc++.h>

using namespace std;

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

const int N = 16010;

int x, y, n, ans;
int cost[N], suma[N];
vector<int> adj[N], viz(N, 0);

void dfs(int nod)
{
    viz[nod] = 1;
    suma[nod] = cost[nod];

    for (auto it : adj[nod])
        if (!viz[it])
        {
            dfs(it);
            if (suma[nod] + suma[it] > suma[nod])
                suma[nod] = suma[nod] + suma[it];
        }
}
int main()
{
    fin >> n;
    for (int i = 1; i <= n; i++)
        fin >> cost[i];
    for (int i = 1; i <= n; i++)
    {
        fin >> x >> y;
        adj[x].push_back(y);
        adj[y].push_back(x);
    }

    dfs(1);

    for (int i = 1; i <= n; i++)
        if (suma[i] > ans)
            ans = suma[i];
    fout << ans;
}