#include <iostream>
#include <fstream>
#include <vector>
#include <cmath>
#include <cassert>

using namespace std;

using ll = long long;
const int INF=1e9+7;
const ll INFF=1e18+7;
#define nl '\n'
void __print(int x) { cout << x; }
void __print(long x) { cout << x; }
void __print(long long x) { cout << x; }
void __print(unsigned x) { cout << x; }
void __print(unsigned long x) { cout << x; }
void __print(unsigned long long x) { cout << x; }
void __print(float x) { cout << x; }
void __print(double x) { cout << x; }
void __print(long double x) { cout << x; }
void __print(char x) { cout << '\'' << x << '\''; }
void __print(const char* x) { cout << '\"' << x << '\"'; }
void __print(const string& x) { cout << '\"' << x << '\"'; }
void __print(bool x) { cout << (x ? "true" : "false"); }
template<typename T, typename V>
void __print(const pair<T, V>& x) { cout << '{'; __print(x.first); cout << ','; __print(x.second); cout << '}'; }
template<typename T>
void __print(const T& x) { int f = 0; cout << '{'; for (auto& i : x) cout << (f++ ? "," : ""), __print(i); cout << "}"; }
void _print() { cout << "]\n"; }
template <typename T, typename... V>
void _print(T t, V... v) { __print(t); if (sizeof...(v)) cout << ", "; _print(v...); }
#ifndef ONLINE_JUDGE
#define debug(x...) cout << "[" << #x << "] = ["; _print(x)
#else
#define debug(x...)
#endif

vector<vector<int>> lift(100001,vector<int>(19));
vector<vector<int>> a(100001);
vector<int> parent(100001), k(100001), ans(100001);
vector<bool> visited(100001);
int n,root;

void computeLift(){
    for(int i=1; i<=18; i++){
        for(int j=1; j<=n; j++){
            lift[j][i]=lift[lift[j][i-1]][i-1];
        }
    }
}

int query(int x, int l){
    int node=x, ll=l;
    for(int i=20; i>=0; i--){
        if((1<<i)<=ll){
            node=lift[node][i];
            ll-=(1<<i);
        }
    }
    return node;
}

void dfs(int x, int p){
    visited[x]=true;
    // debug(x,p,k[x]);
    if(k[x]>0){
        ans[x]=1+ans[query(x,k[x])];
        assert(query(x,k[x])!=0);
        // debug(ans[x]);
    } 
    for(auto&i:a[x]){
        if(!visited[i]) dfs(i,x);
    }
}

void solve()
{
    cin>>n;
    for(int i=1; i<=n; i++){
        cin>>k[i];
    }
    for(int i=1; i<n; i++){
        int x,y;
        cin>>x>>y;
        a[x].emplace_back(y);
        lift[y][0]=x;
        parent[y]=x;
    }
    for(int i=1; i<=n; i++){
        if(!parent[i]){
            root=i;
            break;
        }
    }
    computeLift();
    // cout<<query(21,5)<<nl;
    // debug(root);
    
    dfs(1,-1);
    for(int i=1; i<=n; i++){
        cout<<ans[i]<<" ";
    }
    // debug(ans[13]);
}

int main()
{
// #ifndef ONLINE_JUDGE
    // freopen("input.txt", "r", stdin);
    // freopen("output.txt", "w", stdout);
// #endif
    freopen("cerere.in", "r", stdin);
    freopen("cerere.out", "w", stdout);
    ios::sync_with_stdio(0);
    cin.tie(0);
    int t=1;
    // int t;
    // cin >> t;
    for(int tt=1; tt<=t; tt++){
        // cout<<"#Case "<<t<<nl;
        solve();
    }
    return 0;
}