#include<cstdio>
#include<vector>
using namespace std;
const int NMAX = 100005;
int N,i,X,Y,G[NMAX],A[NMAX],Root,SOL[NMAX],Stack[NMAX],M;
vector<int> V[NMAX];
void DFS(int X)
{
    Stack[++M]=X; if(A[X]) SOL[X]=SOL[Stack[M-A[X]]]+1;
    for(vector<int>::iterator it=V[X].begin();it!=V[X].end();it++) DFS(*it);
    M--;
}
int main()
{
    freopen("cerere.in","r",stdin);
    freopen("cerere.out","w",stdout);
    scanf("%d",&N);
    for(i=1;i<=N;i++) scanf("%d",&A[i]);
    for(i=1;i<N;i++)
    {
        scanf("%d%d",&X,&Y);
        V[X].push_back(Y); G[Y]++;
    }
    for(i=1;i<=N;i++) if(!G[i]) {Root=i; break;}
    DFS(Root); for(i=1;i<=N;i++) printf("%d ",SOL[i]);
    return 0;
}