#include <fstream>
#include <string>
#include <bitset>
#include <set>
#include <queue>
#include <algorithm>
#include <cmath>
#include <cstring>
#include <vector>
#include <stack>
#include <bitset>
#include <stack>
#include <unordered_map>
#define Nmax 100001
using namespace std;

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

typedef vector < pair < int, int > > VIP;
typedef vector < int > VI;

const int oo = 1 << 28;

int n, dad, x, y;
int G[Nmax], Ans[Nmax], Arb[Nmax], In[Nmax], dp[Nmax];
VI V[Nmax];

void DFS(int vertex, int lv){
    Arb[lv] = vertex;
    dp[vertex] = dp[Arb[lv - G[vertex]]] + 1;

    for(int new_vertex : V[vertex])
        DFS(new_vertex, lv + 1);
}

int main() {
    fin >> n;

    for(int i = 1; i <= n; ++i)
        fin >> G[i];    

    for(int i = 1; i <= n - 1; ++i){
        fin >> x >> y;

        V[x].push_back(y);
        In[y]++;
    }

    for(int i = 1; i <= n - 1; ++i)
        if(In[i] == 0){
            dad = i;
            break;
        }

    DFS(dad, 1);

    for(int i = 1; i <= n; ++i)
        fout << dp[i] - 1 << ' ' ;

    return 0;   
}