#include <cstdio>
#include <vector>

#define NMax 100005

using namespace std;

int N, R, S[NMax], K[NMax], F[NMax], Stack[NMax];
vector <int> G[NMax];

void Read ()
{
    freopen ("cerere.in", "r", stdin);
    scanf ("%d", &N);
    for (int i=1; i<=N; ++i)
    {
        scanf ("%d", &K[i]);
    }
    R=N*(N+1)/2;
    for (int i=1; i<N; ++i)
    {
        int X, Y;
        scanf ("%d %d", &X, &Y);
        G[X].push_back (Y);
        F[Y]=X;
        R-=Y;
    }
}

void DFS (int X, int L)
{
    if (K[X]==0)
    {
        S[X]=0;
    }
    else
    {
        S[X]=1+S[Stack[L-K[X]]];
    }
    Stack[L]=X;
    for (unsigned i=0; i<G[X].size (); ++i)
    {
        int V=G[X][i];
        DFS (V, L+1);
    }
}

void Print ()
{
    freopen ("cerere.out", "w", stdout);
    for (int i=1; i<=N; ++i)
    {
        printf ("%d ", S[i]);
    }
    printf ("\n");
}

int main()
{
    Read ();
    DFS (R, 1);
    Print ();
    return 0;
}