#include <bits/stdc++.h>

using namespace std;
const int MAXN=1e5;
#define pb push_back

vector<int> adj[MAXN+1];
int s[MAXN+1];
int m=0;
int dp[MAXN+1];
int k[MAXN+1];

void dfs(int node){
    if(k[node]>0)
        dp[node]=dp[s[m-k[node]]]+1;
    s[m++]=node;
    for(auto e : adj[node])
        dfs(e);
    m--;
}

int main()
{
    ifstream cin("cerere.in");
    ofstream cout("cerere.out");
    int n, i, u, v;
    cin>>n;
    for(i=0; i<n; i++)
        cin>>k[i];
    for(i=0; i<n-1; i++){
        cin>>u>>v;
        adj[--u].pb(--v);
    }
    dfs(0);
    for(i=0; i<n; i++)
        cout<<dp[i]<<" ";
    return 0;
}