#include <stdio.h>
#include <vector>

using namespace std;

int n, viz[100100], val[100100], m[100100], k, c[100100];
vector<int> l[100100];
FILE*f=fopen("cerere.in","r"),*g=fopen("cerere.out","w");


void DFS(int nod)
{
    c[++k] = nod;
    for(int i = 0; i < l[nod].size(); i++)
    {
        if(val[l[nod][i]] != 0)
            m[l[nod][i]] = m[c[k+1-val[l[nod][i]]]] + 1;
        else m[l[nod][i]] = 0;
        DFS(l[nod][i]);
    }
    k--;
}


int main()
{
    fscanf(f, "%d\n", &n);
    for(int i = 1; i <= n; i++)
    {
        fscanf(f,"%d ",&val[i]);
    }
    int x, y, in;
    in = n*(n+1)/2;
    for(int i = 1; i <= n-1; i++)
    {
        fscanf(f,"%d %d\n",&x,&y);
        l[x].push_back(y);
        in -= y;
        //l[y].push_back(x);
    }
    DFS(in);
    for(int i = 1; i <= n; i++)
        fprintf(g,"%d ",m[i]);
    return 0;
}