#include <fstream>
#include <climits>
#include <vector>
#define DIM 100000
using namespace std;

ifstream fin("cerere.in");
ofstream fout("cerere.out");

int n, x, y;
int K[DIM], parent[DIM], vis[DIM], dist[DIM];
vector <int> L[DIM];

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

    for (int i = 0; i < L[node].size(); i++)
    {
        int child = L[node][i];
        if (vis[child] == 0)
        {
            parent[child] = node;
            dfs(child);
        }
    }
}


int getRoot(int node)
{
    int aux = K[node];
    while (aux != 0)
    {
        node = parent[node];
        aux--;
    }
    return node;
}

int main()
{
    fin >> n;
    for (int i = 1; i <= n; i++)
        fin >> K[i];
    for (int i = 1; i < n; i++)
    {
        fin >> x >> y;
        L[x].push_back(y);
        L[y].push_back(x);
    }

    dfs(1);

    for (int i = 2; i <= n; i++)
    {
        int d = 0;
        int root = i;
        while (K[root] > 0)
        {
            root = getRoot(root);
            d++;
        }
        dist[i] = d;
    }

   
    for (int i = 1; i <= n; i++)
    {
        fout << dist[i] << " ";
    }
    return 0;
}