#include<cstdio>
#include<vector>
#include<bitset>
#include<fstream>
using namespace std;
bitset<100010> suprem,viz;
vector<int> fiu[100010];
int i,n,x,y,A[100010],dad[100010],ROOT,cnt,ST[100010],SOL[100010],REZ[100010];
void DFS(int);
ifstream cin("cerere.in");
ofstream cout("cerere.out");
int main()
{
    //freopen("cerere.in","r",stdin);
    //freopen("cerere.out","w",stdout);
    cin>>n;
    for(i=1;i<=n;i++)cin>>A[i];
    for(i=1;i<n;i++)
    {
        cin>>x>>y;
        suprem[y]=1;
        fiu[x].push_back(y);
        dad[y]=x;
    }
    for(i=1;i<=n;i++)if(!suprem[i])ROOT=i;
    REZ[ROOT]=0;
    DFS(ROOT);
    for(i=1;i<=n;i++)cout<<REZ[i]<<" ";
    return 0;
}
void DFS(int X)
{
    ST[++cnt]=X;
    SOL[X]=ST[cnt-A[X]];
    if(SOL[X]!=X)REZ[X]=REZ[SOL[X]]+1;
    for(vector<int>::iterator it=fiu[X].begin();it!=fiu[X].end();it++)
        if(!viz[*it])DFS(*it);
    ST[cnt--]=0;
}