#include <iostream>
#include <fstream>
#include <vector>
#include <stack>

using namespace std;
ifstream in("cerere.in");
ofstream out("cerere.out");

const int Nmax = 100005;
int n;
int V1[Nmax], Use[Nmax], Vsol[Nmax], TT[Nmax] , Vlog2[Nmax], V2[Nmax], snod;
vector <int> G[Nmax];

void DFS(int Nod)
{
    Use[Nod] = 1;
    for(int i = 0; i < (int)G[Nod].size(); i++)
    {
        int Vecin = G[Nod][i];
        V2[++snod] = Vecin;
        int stramos = V2[snod - V1[Vecin]];
        if(Vecin != stramos) Vsol[Vecin] = Vsol[stramos] + 1;
        DFS(Vecin);
        snod--;
    }
}
void Read()
{
    in>>n;
    for(int i = 1; i <= n; i++)
    in>>V1[i];
    for(int i = 1; i < n; i++)
    {
        int x,y;
        in>>x>>y;
        G[x].push_back(y);
        TT[y] = x;
    }
}
void Solve()
{
    for(int i = 1; i <= n; i++)
    {
        if(TT[i] == 0)
        {
            Vsol[++snod] = i;
            DFS(i);
            i = n+1;
        }
    }
}
void Print()
{
    for(int i = 1; i <= n; i++)
    {
        out<<Vsol[i]<<' ';
    }
}
int main()
{
    Read();
    Solve();
    Print();
    return 0;
}