#include <bits/stdc++.h>
#define N 100005

using namespace std;

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

vector<int> graf[N] ;
int p[N] , sol[N] , n , d[N] , start ;
bool viz[N] , vaz[N] ;

void citire()
{
    int i , x , y ;
    fin >> n ;
    for ( i = 1 ; i <= n ; i++ )
        fin >> p[i] ;
    for ( i = 1 ; i <= n ; i++ )
    {
        fin >> x >> y ;
        vaz[y] = true ;
        graf[x].push_back(y) ;
        graf[y].push_back(x) ;
    }
    for ( i = 1 ; i <= n ; i++ )
        if ( vaz[i] == 0 )
            start = i ;
}

void dfs(int nod,int lvl)
{
    d[lvl] = nod ;
    viz[nod] = 1 ;
    sol[nod] = 1+sol[d[lvl-p[nod]]] ;
    for ( auto vec : graf[nod] )
        if ( viz[vec] == 0 )
            dfs(vec,lvl+1) ;
}

int main()
{
    citire() ;
    dfs(start,1) ;
    for ( int i = 1 ; i <= n ; i++ )
        fout << sol[i]-1 << " " ;
}