#include <bits/stdc++.h>
#define MAX 100001
using namespace std;

FILE *f1 = fopen("cerere.in", "r");
FILE *f2 = fopen("cerere.out", "w");

int n, i, a, b, intern[MAX], root, v[MAX], result[MAX], nr, vis[MAX], k[MAX];
vector<int> G[MAX];

void DFS(int node)
{
    vis[node] = 1;
    if (k[node] == 0)
        result[node] = 0;
    else
        result[node] = 1 + result[v[nr - k[node] + 1]];
    nr++;
    v[nr] = node;

    int i;
    for (i = 0; i < G[node].size(); i++)
        if (vis[G[node][i]] == 0)
            DFS(G[node][i]);

    nr--;
}

int main()
{
    fscanf(f1, "%d", &n);
    for (i = 1; i <= n; i++)
        fscanf(f1, "%d", &k[i]);
    for (i = 1; i <= n - 1; i++)
    {
        fscanf(f1, "%d%d", &a, &b);
        intern[b]++;
        G[b].push_back(a);
        G[a].push_back(b);
    }

    for (i = 1; i <= n; i++)
        if (intern[i] == 0)
        {
            root = i;
            break;
        }
    result[root] = 0;
    nr = 1;
    v[1] = root;

    DFS(root);

    for (i = 1; i <= n; i++)
        fprintf(f2, "%d ", result[i]);

    fclose(f1);
    fclose(f2);
    return 0;
}