#pragma GCC optimize("03")
#include <bits/stdc++.h>
#define ll long long
#define PII pair < int , int >
#define MOD 1000000007
#define PI 3.14159265359
 
using namespace std;
 
int n, m, a[100100], dp[100100], dad[100100][20], pre[100100];
vector < int > V[100100];
bool taken[100100], viz[100100];

void dfs(int node) {
    viz[node] = 1;

    int kthParent = a[node], ancestor = node;
    while (kthParent) {
        int rem = pre[kthParent];
        kthParent -= (1 << rem);
        ancestor = dad[ancestor][rem];
    }

    dp[node] = dp[ancestor] + (node != ancestor);

    for (auto it : V[node]) {
        if (viz[it]) continue;

        dfs(it);
    }
}

int main(){
    ios_base::sync_with_stdio(0);
    cin.tie(NULL);
    ifstream cin("cerere.in");
    ofstream cout("cerere.out");

    cin >> n;
    for (int i = 1; i <= n; i++) {
        cin >> a[i];

        pre[i] = log2(i);
        if ((1 << pre[i]) < i) pre[i]++;
    }

    for (int i = 1, x, y; i < n; i++) {
        cin >> x >> y;
        V[x].push_back(y);
        dad[y][0] = x;

        taken[y] = 1;
    }

    for (int i = 1; i <= n; i++) {
        int m = pre[a[i]];
        for (int j = 1; j <= m; j++) {
            dad[i][j] = dad[dad[i][j - 1]][j - 1];
        }
    }

    int root = 1;
    for (int i = 1; i <= n; i++) {
        if (!taken[i]) root = i;
    }

    dfs(root);

    for (int i = 1; i <= n; i++) cout << dp[i] << " ";
    
    return 0;
}