#include <iostream>
#include <fstream>
#include <vector>
using namespace std;
ifstream f("cerere.in");
ofstream g("cerere.out");
vector <int> q[100010];
int a[100010],b[100010],t[100010],rad,n,i,j,k,nr;
void dfs(int i)
{ if(a[i]==0) b[i]=0;
else
{
b[i]=b[t[nr+1-a[i]]]+1;//cout<<i<<" "<<y<<" "<<b[i]<<" "<<b[y]<<"\n";
}
t[++nr]=i;
  for(vector <int> ::iterator it=q[i].begin();it<q[i].end();it++)
    dfs(*it);
nr--;
}
int main()
{ f>>n;
for(k=1;k<=n;k++)
    f>>a[k];
for(k=1;k<n;k++)
{f>>i>>j;
  q[i].push_back(j);
}
rad=1;
while(t[rad]!=0) rad=t[rad];
dfs(rad);
for(i=1;i<=n;i++)
    g<<b[i]<<" ";
    return 0;
}