#include <fstream>
#include <vector>
using namespace std;
ifstream fin("cerere.in");
ofstream fout("cerere.out");
const int NMax = 100000;
vector <int> G[NMax + 5];
int K[NMax + 5],TT[NMax + 5],Stack[NMax + 5],DP[NMax + 5];
int N,Root;
void Read()
{
    fin >> N;
    for(int i = 1; i <= N; ++i)
        fin >> K[i];
    for(int i = 1; i < N; ++i)
    {
        int x,y;
        fin >> x >> y;
        G[x].push_back(y);
        TT[y] = x;
    }
    for(int  i = 1; i <= N; ++i)
        if(TT[i] == 0 )
            Root = i;
}

void DFS(int Nod)
{
    Stack[++Stack[0]] = Nod;
    if(K[Nod] != 0)
        DP[Nod] = 1 + DP[Stack[Stack[0] - K[Nod]]];
    for(auto Vecin : G[Nod])
    {
        DFS(Vecin);
    }
    Stack[0]--;
}
void Print()
{
    for(int i = 1; i <= N; ++i)
        fout << DP[i] << " ";
    fout << "\n";
}
int main()
{
    Read();
    DFS(Root);
    Print();
    return 0;
}