#include <algorithm>
#include <iostream>
#include <fstream>
#include <vector>
#include <cstring>
using namespace std;
ifstream fin("cerere.in");
ofstream fout("cerere.out");
const int NMax=100005;

int N,A[NMax],F[NMax],st,R,S[NMax];
vector <int> G[NMax];
void Read()
{
    fin>>N;
    for (int i=1;i<=N;++i)
    {
        fin>>A[i];
    }
    for (int i=1;i<N;++i)
    {
        int A,B;
        fin>>A>>B;
        F[B]=1;
        G[A].push_back(B);
    }

}


void DFS(int Nod)
{
if(!A[Nod])
    F[Nod]=0;
else
        F[Nod]=F[S[st-A[Nod]+1]]+1;
    S[++st]=Nod;
  for(unsigned int j=0;j<G[Nod].size();++j)
  {
      int Vecin=G[Nod][j];
      DFS(Vecin);
  }
  st--;
}








int main()
{
    Read();

   for(int i=1;i<=N;i++)
    {
        if(!F[i])
            R=i;
        F[i]=0;
    }
    DFS(R);
    for(int i=1;i<=N;i++)
    {
        fout<<F[i]<<" ";
    }
    return 0;
}