#include <cstdio>
#include <cstring>
    
using namespace std;
    
#define N 100001
    
#define dim 16000
char ax[dim];
int pz;
    
inline void cit(int &x) {
    x = 0;
    while (ax[pz] < '0' || ax[pz] > '9')
        if (++pz == dim)
            fread(ax, 1, dim, stdin), pz = 0;
    while (ax[pz] >= '0' && ax[pz] <= '9') {
        x = x * 10 + ax[pz] - '0';
        if (++pz == dim)
            fread(ax, 1, dim, stdin), pz = 0;
    }
}
    
char bx[dim];
int bz;
    
inline void scrie(int x) {
    char s[7];
    int  ns = 0;
    if (x == 0) {
        s[ns++] = 0;
    }
    else {
        while (x) {
            s[ns++] = x % 10;
            x /= 10;
        }
        s[ns] = 0;
    }
    for (int i = ns - 1; i >= 0; --i) {
        bx[bz] = s[i] + '0';
        if (++bz == dim)
            fwrite(bx, 1, dim, stdout), bz = 0;
    }
       
    bx[bz] = ' ';
    if (++bz == dim)
        fwrite(bx, 1, dim, stdout), bz = 0;
}
    
    
struct nod {
    int v;
    nod *next;
};
    
nod *a[N];
    
int parent[N];
    
int st[N];
int n;
    
int root = 0;
int nst;
    
int sol[N];
    
void add(int p, int q) {
    nod *u = new nod;
    u->v = q;
    u->next = a[p];
    a[p] = u;
}
    
inline void dfs(int u) {
    st[++nst] = u;
    
    if (parent[u] != 0)
        sol[u] = sol[ st[ nst - parent[u] ] ] + 1;
    
    for (nod *it = a[u]; it; it = it->next)
        dfs(it->v);
    
    --nst;
}
   
    
void afisare() {
    for (int i = 1; i <= n; ++i)
        scrie(sol[i]);
    bx[bz++] = '\n';
    fwrite(bx, 1, bz, stdout);
    
}
    
int main() {
    
    freopen ("cerere.in", "r", stdin);
    freopen ("cerere.out", "w", stdout);
    cit(n);
    int i;
    for (i = 1; i <= n; ++i)
        cit(parent[i]);
    
    int p, q;
    int sum = 0;
    for (i = 1; i < n; ++i) {
        cit(p); cit(q);
        add(p, q);
        sum += q;
    }
    root = (n * (n + 1)) / 2 - sum;
    
    dfs(root);
    
    afisare();
}