#include <fstream>
#include <vector>
#define pb push_back
#define NMAX 100001
using namespace std;

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

int n,i,k[NMAX],mny[NMAX],root,level[NMAX],a,b;
vector<int> A[NMAX];
void dfs(int nod,int lvl) {
    vector<int>::iterator i;
    level[lvl]=nod;
    mny[nod]=1+mny[level[lvl-k[nod]]];
    if (!k[nod]) --mny[nod];
    for (i=A[nod].begin();i!=A[nod].end();i++)
        dfs(*i,lvl+1);
}

int main () {
    f >> n;
    for (i=1;i<=n;i++)
        f >> k[i];
    root=(n*n+n)/2;
    for (i=1;i<n;i++) {
        f >> a >> b;
        A[a].pb(b);
        root-=b;
    }
    dfs(root,1);
    for (i=1;i<=n;i++) g << mny[i] << ' ';
    g << '\n';
    f.close();g.close();
    return 0;
}