#include<cstdio>
#include<vector>

using namespace std;

const int NMAX = 100005;

int N;
int K[NMAX];
int T[NMAX];
int Sol[NMAX];
vector<int> S;
vector<int> V[NMAX];

void DFS(int x)
{
    vector<int>::iterator it;
    S.push_back(x);
    if(K[x]) Sol[x]=Sol[S[S.size()-K[x]-1]]+1;
    for(it=V[x].begin();it!=V[x].end();it++)
        DFS(*it);
    S.pop_back();
}

int main()
{
    int i,a,b;
    freopen("cerere.in","r",stdin);
    freopen("cerere.out","w",stdout);
    scanf("%d",&N);
    for(i=1;i<=N;i++)
        scanf("%d",&K[i]);
    for(i=1;i<=N-1;i++)
    {
        scanf("%d%d",&a,&b);
        V[a].push_back(b);
        T[b]=a;
    }
    for(i=1;i<=N;i++)
        if(T[i]==0) break;
    DFS(i);
    for(i=1;i<=N;i++)
        printf("%d ",Sol[i]);
    return 0;
}