#include<fstream>
#include<iostream>
#include<climits>
#include<algorithm>
#include<cstring>
#include<cmath>
#include <vector>

#define MAX 100000

using namespace std;

ifstream f("cerere.in");
ofstream g("cerere.out");

//ifstream f("in.in");
//ofstream g("out.out");

vector <int> l[MAX+5];
int n,m,x,y;
int viz[MAX+5];
int k[MAX+5];
int sol[MAX+5];
int st[MAX+5];
int t[MAX+5];


void dfs(int nod,int niv){

    viz[nod] = 1;
    st[niv] = nod;

    sol[nod] = sol[st[niv-k[nod]]] + (k[nod]!=0);

    for(int i=0;i<l[nod].size();i++){
        int fiu = l[nod][i];
        if(viz[fiu] == 0){
            dfs(fiu,niv+1);
        }
    }

}

int main(){

    f>>n;
    for(int i=1;i<=n;i++){
        f>>k[i];
    }
    for(int i=1;i<n;i++){
        f>>x>>y;
        l[x].push_back(y);
        t[y] = x;
    }

    for(int i=1;i<=n;i++){
        if(t[i] == 0){
            dfs(i,1);
            break;
        }
    }

    for(int i=1;i<=n;i++){
        g<<sol[i]<<" ";
    }

    f.close();
    g.close();
    return 0;
}