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

const int NMAX = 100010;

int N, K[NMAX], X, Y, Stack[NMAX], Top, Cnt[NMAX], Father[NMAX];
vector<int> G[NMAX];

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

    for(int i = 0; i < G[Node].size(); ++ i)
        DFS(G[Node][i]);

    Top --;
}

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);
        Father[Y] = X;
    }

    for(int i = 1; i <= N; ++ i)
        if(!Father[i])
            DFS(i);

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