#include <fstream>
#include <vector>
using namespace std;
ifstream cin("cerere.in");
ofstream cout("cerere.out");
int n, x, y;
vector<vector<int>> graf;
vector<int> arb, viz, noduri, ans, gr;
void dfs(int node, int h)
{
    viz[node] = 1;
    noduri.push_back(node);
    ans[node] = 1 + ans[noduri[h - arb[node]]];
    for(auto next:graf[node])
        if(!viz[next])
            dfs(next, h + 1);
    noduri.pop_back();
}
int main()
{
    cin >> n;
    graf.assign(n+1, vector<int>());
    arb.resize(n+1);
    viz.resize(n+1);
    ans.resize(n+1);
    gr.resize(n+1);
    for(int i=1; i<=n; i++)
        cin >> arb[i];
    for(int i=1; i<n; i++)
    {

        cin >> x >> y;
        gr[y]++;
        graf[x].push_back(y);
        graf[y].push_back(x);
    }
    for(int i=1; i<=n; i++)
        if(!gr[i])
            dfs(i, 0);
    for(int i=1; i<=n; i++)
        cout << ans[i] - 1 << " ";
    return 0;
}