#include <iostream>
#include <fstream>
#include <vector>
using namespace std;
#define N_MAX 16005
ifstream f("asmax.in");
ofstream g("asmax.out");
vector <int> G[N_MAX];
int n, v[N_MAX], dp[N_MAX];
bool viz[N_MAX];
void df(int nod)
{
    viz[nod] = 1;

    for(auto it : G[nod])
    {
        if(viz[it] == 0)
        {
            df(it);
            dp[nod] = max(dp[nod], dp[it]+dp[nod]);
        }
    }
}

int main()
{
    f >> n;
    for(int i = 1; i <= n; i++)
        f >> dp[i];

    int x, y;
    for(int i = 1; i < n; i++)
    {
        f >> x >> y;
        G[x].push_back(y);
        G[y].push_back(x);
    }

    df(1);

    int rez = -(1 << 31) + 1;
    for(int i = 1; i <= n; i++){
        cout<<dp[i]<<" ";
        rez = max (rez, dp[i]);
    }
    g << rez;
    return 0;
}