#include <fstream>
#include <vector>
#define VAL 110000
using namespace std;
ifstream f ("cerere.in");
ofstream g ("cerere.out");
vector <int> L[VAL];
int i, st, n, x, y;
int D[VAL], K[VAL], nr[VAL], fr[VAL];

void dfs ( int nod, int niv ){
    D[niv] = nod;
    nr[nod] = nr[D[niv-K[nod]]]+1;
    for ( int i = 0; i < L[nod].size(); i++ ){
        int vecin = L[nod][i];
        dfs(vecin, niv+1);
    }
}

int main()
{
    f>>n;
    for ( i=1; i <= n; i++ ) f>>K[i];

    while ( f>>x>>y ){
        fr[y]++;
        L[x].push_back(y);
    }
    for ( i=1; !st && i <= n; i++ )
        if ( !fr[i] )
            st = i;

    dfs ( st, 1 );
    for ( i=1; i <= n; i++ )
        g<<nr[i]-1<<" ";
    return 0;
}