#include <cstdio>
#include <vector>
using namespace std;
const int NMAX = 100005;
vector <int> v[NMAX], s;
int k[NMAX];
int sol[NMAX];
int dfs(int nod)
{
    if(k[nod]) {
        sol[nod] = 1 + sol[s[s.size() - k[nod]]];
    }
    s.push_back(nod);
    for(int i = 0;i < v[nod].size(); ++i) {
        dfs(v[nod][i]);
    }
    s.pop_back();
}

int main()
{
    int n, i, a, b, nod;
    freopen("cerere.in","r",stdin);
    freopen("cerere.out","w",stdout);
    scanf("%d", &n);
    for(i = 1;i <= n; ++i) {
        scanf("%d", &k[i]);
    }
    for(i = 1;i <= n - 1; ++i) {
        scanf("%d%d",  &a, &b);
        v[a].push_back(b);
    }
    for(i = 1;i <= n; ++i) {
        if(k[i] == 0) {
            nod = i;
            i = n + 1;
        }
    }
    dfs(nod);
    for(i = 1;i <= n; ++i) {
        printf("%d ", sol[i]);
    }
    printf("\n");
    return 0;
}