#include <fstream>
#include <vector>
using namespace std;
ifstream fin("cerere.in");
ofstream fout("cerere.out");
const int NMax = 100000;
int N,Root;
vector <int> G[NMax + 5],Stack;
int Use[NMax + 5],K[NMax + 5],Sol[NMax + 5];
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);
        Use[y] = 1;
    }
    for(int i = 1; i <= N; ++i)
        if(Use[i] == 0)
            Root = i;
}
void DFS(int Nod)
{
    Stack.push_back(Nod);
    if(K[Nod])
        Sol[Nod] = 1 + Sol[Stack[(Stack.size() - 1 - K[Nod])]];
    for(int i = 0; i < (int)G[Nod].size(); ++i)
    {
        int Vecin = G[Nod][i];
        DFS(Vecin);
    }
    Stack.pop_back();
}

void Print()
{
    for(int i = 1 ; i <= N; ++i)
        fout << Sol[i] << " ";
    fout << "\n";
}

int main()
{
    Read();
    DFS(Root);
    Print();
    return 0;
}