#include <fstream>
#include <vector>
#include <string.h>
using namespace std;
ifstream f("cerere.in");
ofstream g("cerere.out");
int Ancestor[100002];
int N;
int Sol[100002];
int Nodes[100002],ind;
bool Use[100002];
int TT[100002];
vector <int> G[100002];
void Read()
{
    int i;
    f>>N;
    for(i=1;i<=N;i++)
        f>>Ancestor[i];
    for(i=1;i<=N-1;i++)
    {
        int x,y;
        f>>x>>y;
        TT[y]=x;
        G[x].push_back(y);
    }
}
void DFS1(int nod)
{
    unsigned int i;
    Use[nod]=1;
    Nodes[++ind]=nod;
    if(Ancestor[nod]!=0)
        Sol[nod]=Sol[Nodes[ind-Ancestor[nod]]]+1;
    for(i=0;i<=G[nod].size();i++)
        {
            int Vecin=G[nod][i];
            if(!Use[Vecin])
                DFS1(Vecin);
        }
    ind--;
}
void DFS(int nod)
{
    vector <int> :: iterator it;
    Use[nod]=1;
    Nodes[++ind]=nod;
    if(Ancestor[nod]!=0)
        Sol[nod]=Sol[Nodes[ind-Ancestor[nod]]]+1;
    for(it=G[nod].begin();it!=G[nod].end();it++)
        if(!Use[*it])
            DFS(*it);
    ind--;
}
/*void Initialize_TT()
{
    int i;
    for(i=1;i<=N;i++)
    {
        int counter=0;
        if(Ancestor[i]!=0)
            Fathers[i]=TT[i],counter=1;
        while(counter<Ancestor[i])
        {

            Fathers[i]=TT[Fathers[i]];
            counter++;
        }
    }
}
void Solve()
{
    int i;
    for(i=1;i<=N;i++)
    {
        int Result=0,current=Fathers[i];
        while(current!=0)
        {
            Result++;
            current=Fathers[current];
        }
        g<<Result<<" ";
    }
    g<<"\n";
}*/
int main()
{
    Read();
    for(int i=1;i<=N;i++)
        if(TT[i]==0)
        {
            DFS(i);
            break;
        }
    for(int i=1;i<=N;i++)
        g<<Sol[i]<<" ";
    g<<"\n";
    return 0;
}