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

const int NMAX = 100010;

int N, K[NMAX], Stack[NMAX], Pos, A, B, Ans[NMAX], In[NMAX];
vector<int> G[NMAX];

void DFS(int Node)
{
    Stack[++Pos] = Node;
    if(K[Node] == 0) Ans[Node] = 0;
    else Ans[Node] = Ans[Stack[Pos - K[Node]]] + 1;

    for(vector<int> :: iterator it = G[Node].begin(); it != G[Node].end(); ++ it)
        DFS(*it);

    Pos --;
}

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

    scanf("%i", &N);
    for(int i = 1; i <= N; ++ i) scanf("%i", &K[i]);
    for(int i = 1; i < N; ++ i)
    {
        scanf("%i %i", &A, &B);
        G[A].push_back(B);
        In[B] ++;
    }

    for(int i = 1; i <= N; ++ i)
        if(In[i] == 0)
        {
            DFS(i);
            break;
        }

    for(int i = 1; i <= N; ++ i) printf("%i ", Ans[i]);

    return 0;
}