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

const int NMAX = 100010;

int N, K[NMAX], X, Y, Stack[NMAX], Pos, Ans[NMAX], DegIn[NMAX];
vector<int> G[NMAX];
bool Used[NMAX];

void DFS(int Node)
{
    Used[Node] = 1;
    Stack[++ Pos] = Node;
    if(K[Node]) Ans[Node] = Ans[Stack[Pos - K[Node]]] + 1;
    for(vector<int> :: iterator it = G[Node].begin(); it != G[Node].end(); ++ it)
        if(!Used[*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", &X, &Y);
        G[X].push_back(Y);
        DegIn[Y] ++;
    }

    for(int i = 1; i <= N; ++ i)
        if(DegIn[i] == 0)
        {
            DFS(i);
            break;
        }
    for(int i = 1; i <= N; ++ i) printf("%i ", Ans[i]);
}