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

const int NMAX=100005;

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

void dfs(int x)
{
    if(x!=dad[x]) solve[x]=solve[dad[x]]+1;

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

int main()
{
    ifstream in("cerere.in");
    ofstream out("cerere.out");

    int n,a,b,i,j;

    in>>n;
    for(i=1;i<=n;i++) in>>v[i];

    for(i=1;i<n;i++)
    {
        in>>a>>b;
        G[a].push_back(b);
        d[0][b]=a;
    }

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

    for(j=1;j<=n;j++)
    {
        a=v[j];
        b=j;
        for(int i=0;i<=3;i++)
            if(a&(1<<i)) b=d[i][b];

        dad[j]=b;
    }

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


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

    return 0;
}