#include <iostream>
#include<vector>
#include<fstream>

using namespace std;
vector <int> L[100010];
int n,k[100010],grad[100010],stiva[100010],vf,radacina,g[100010];
void citire()
{
    int i,x,y;
    ifstream fin("cerere.in");
    fin>>n;
    for(i=1;i<=n;i++)
        fin>>k[i];
    for(i=1;i<=n;i++)
    {
        fin>>x>>y;
        grad[y]++;
        L[x].push_back(y);
    }
    fin.close();
    for(i=1;i<=n;i++)
        if(grad[i]==0)
        {
            radacina=i;
            i=n+2;
        }
}
void DFS(int nod)
{
    stiva[++vf]=nod;
    if(k[nod]==0)
        g[nod]=0;
    else
        g[nod]=1+g[stiva[vf-k[nod]]];
    vector <int>::iterator it;
    for(it=L[nod].begin(); it!= L[nod].end();it++)
        DFS(*it);
    vf--;

}
int main()
{
    citire();
    DFS(radacina);

    ofstream fout("cerere.out");
    for(int i=1;i<=n;i++)
        fout<<g[i]<<" ";
    fout<<"\n";
    fout.close();
    return 0;
}