#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;
//const int oo=2000000000;
int N,A[NMax],F[NMax],Sol[NMax],ST[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]=A;
        G[A].push_back(B);
    }
}
void stramos()
{

    for(int i=1;i<=N;++i)
    {
        int k=1,x=F[i];
        while(k<A[i])
        {
            k++;
            x=F[x];
        }
        ST[i]=x;
    }
    ST[1]=0;
}


void DFS(int Nod)
{

  for(unsigned int j=0;j<G[Nod].size();++j)
  {
      int Vecin=G[Nod][j];
      if(A[Vecin]==0)
      {
          Sol[Vecin]=0;
      }
      else{
      Sol[Vecin]=Sol[ST[Vecin]]+1;
      }
      DFS(Vecin);
  }
}

void Solve()
{

    stramos();
    DFS(1);




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

int main()
{
    Read();

    Solve();
    return 0;
}