#include <iostream>
#include <fstream>
#include <vector>
#define maxn 100010
using namespace std;

ifstream in("cerere.in");
ofstream out("cerere.out");

int n,k,nr[maxn],st[maxn];
bool viz[maxn],q[maxn];
vector <int> Graf[maxn];
int sol[maxn];

void DFS(int nod)
{
    viz[nod]=1;
    st[++k]=nod;
    if(nr[nod]!=0)
        sol[nod]=sol[st[k-nr[nod]]]+1;
    for(auto i : Graf[nod])
        if(!viz[i])
        {
            DFS(i);
        }
    k--;

}

int main()
{
    int i,x,y,r;
    in>>n;
    for(i=1;i<=n;i++)
        in>>nr[i];

    while(in>>x>>y)
    {
        Graf[x].push_back(y);
        q[y]=1;
    }

    for(i=1;i<=n;i++)
        if(!q[i])
            r=i;

    DFS(r);


    for(i=1;i<=n;i++)
        out<<sol[i]<<" ";
    return 0;
}