#include <bits/stdc++.h>
#define int long long
#define cin ci
#define cout co
using namespace std;
ifstream cin("asmax.in");
ofstream cout("asmax.out");
int n;
vector<vector<int>> graf;
vector<int> v, dp;
void dfs(int node, int par)
{
    dp[node] = v[node];

    for(auto next : graf[node])
        if(next != par)
        {
            dfs(next, node);
            dp[node] = max(dp[node], dp[node] + dp[next]);
        }
}
int32_t main()
{
    cin >> n;
    v.resize(n + 5);
    dp.assign(n + 5, 0);
    for(int i = 1; i <= n; i ++)
        cin >> v[i];
    graf.assign(n + 5, vector<int>());
    for(int i = 1; i < n; i ++)
    {
        int x, y;
        cin >> x >> y;
        graf[x].push_back(y);
        graf[y].push_back(x);
    }
    dfs(1, 0);
    int ans = -1e9;
    for(int i = 1; i <= n; i ++)
        ans = max(ans, dp[i]);
    cout << ans;
    return 0;
}