#include <bits/stdc++.h>

using namespace std;

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

int n, k[100100];
bool root[100100];
int stiva[100100];
vector<int> v[100100];
int dp[100100];

void dfs(int nod, int nivel)
{
    stiva[nivel] = nod;
    if(k[nod] != 0)
    {
        dp[nod] = 1 + dp[stiva[nivel - k[nod]]];
    }
    for(auto it : v[nod])
    {
        dfs(it, nivel + 1);
    }
}

int main()
{
    fin >> n;
    for(int i = 1; i <= n; i ++)
    {
        fin >> k[i];
    }
    for(int i = 1; i < n; i ++)
    {
        int x, y;
        fin >> x >> y;
        v[x].push_back(y);
        root[y] = true;
    }
    int radacina = 0;
    for(int i = 1; i <= n; i ++)
    {
        if(!root[i])
        {
            radacina = i;
            break;
        }
    }
    dfs(radacina, 0);
    for(int i = 1; i <= n; i ++)
    {
        fout << dp[i] << ' ';
    }
    fout << '\n';
    return 0;
}