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

void dfs ( short int nod, short int niv ){
    v[nod] = 1;
    D[niv] = nod;
    nr[nod] = nr[D[niv-K[nod]]]+1;
    for ( short int i = 0; i < L[nod].size(); i++ ){
        short int vecin = L[nod][i];
        if ( !v[vecin] )
            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);
        L[y].push_back(x);
    }
    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;
}