#include <cstdio>
#include <vector>
using namespace std;

const int NMAX=100005;

vector <int> G[NMAX];
int v[NMAX],d[20][NMAX],solve[NMAX];

void dfs(int x)
{
    int a=v[x],b=x;

    if(a==0) solve[x]=0;
    else
    {
        for(int i=0;i<=15;i++)
            if(a&(1<<i)) b=d[i][b];

        solve[x]=solve[b]+1;
    }


    for(int i=0;i<(int)G[x].size();i++)
    {
        int y=G[x][i];
        dfs(y);
    }
}

int main()
{
    freopen("cerere.in","r",stdin);
    freopen("cerere.out","w",stdout);

    int n,a,b,i,j;

    scanf("%d",&n);
    for(i=1;i<=n;i++) scanf("%d",&v[i]);

    for(i=1;i<n;i++)
    {
        scanf("%d%d",&a,&b);
        G[a].push_back(b);
        d[0][b]=a;
    }

    for(i=1;i<=15;i++)
        for(j=1;j<=n;j++)
            d[i][j]=d[i-1][d[i-1][j]];

    for(i=1;i<=n;i++)
        if(d[0][i]==0) dfs(i);

    for(i=1;i<=n;i++) printf("%d ",solve[i]);
    printf("\n");

    return 0;
}