#include <cstdio>
#include <cstdlib>
#include <climits>
#include <map>
#include <iostream>
#define mod 666013

long long cit() {
    long long ans = 0;
    char c = getchar();
    bool neg = false;
    while (c < '0' || c > '9') {
        if (c == '-') {
            c = getchar();
            neg = true;
            break;
        }
        c = getchar();
    }
    while (c >= '0' && c <= '9') {
        ans = (ans << 3) + (ans << 1) + (c - '0');
        c = getchar();
    }
    return (neg) ? -ans : ans;
}

void afis(long long n, char d) {
    int l = 0;
    char c[20];
    if (n == 0) {
        putchar('0');
    }
    if (n < 0) {
        putchar('-');
        n = -n;
    }
    while (n > 0) {
        c[l++] = n % 10 + '0';
        n /= 10;
    }
    for (int i = l - 1; i >= 0; i--) {
        putchar(c[i]);
    }
    putchar(d);
}

using namespace std;

int m[17][100005], v[100005];

int f(int i) {
    if (v[i] == 0) {
        return 0;
    }
    int next = i, poz = 0, aux = v[i];
    while (aux > 0) {
        if (aux % 2 == 1) {
            next = m[poz][next];
        }
        poz++;
        aux >>= 1;
    }
    return 1 + f(next);
}

int main() {
    freopen("cerere.in", "r", stdin);
    freopen("cerere.out", "w", stdout);
//  freopen("tt.txt", "r", stdin);

    int n = cit();
    for (int i = 1; i <= n; i++) {
        v[i] = cit();
    }
    for (int i = 1; i < n; i++) {
        int a = cit(), b = cit();
        m[0][b] = a;
    }
    for (int j = 1; j < 17; j++) {
        for (int i = 1; i <= n; i++) {
          m[j][i] = m[j - 1][m[j - 1][i]];
        }
    }
    for (int i = 1; i <= n; i++) {
        int ans = f(i);
       afis(ans, ' ');
    }


    return 0;
}