#include <fstream>
#include <vector>

const int MAX_N = 1e5;
const int MAX_LOG = 18;
int k[1 + MAX_N], answer[1 + MAX_N];
int up[1 + MAX_N][1 + MAX_LOG];
std::vector<int> g[1 + MAX_N];
std::vector<int> ord;

void dfs(int v, int p = 0) {
  up[v][0] = p;
  for (int i = 1; i < MAX_LOG; i++) {
    up[v][i] = up[up[v][i - 1]][i - 1];
  }
  ord.push_back(v);
  for (int u : g[v]) {
    if (u != p) {
      dfs(u, v);
    }
  }
}

int main() {
  std::ifstream fin("cerere.in");
  std::ofstream fout("cerere.out");
  int n, m;
  fin >> n;
  for (int i = 1; i <= n; i++) {
    fin >> k[i];
  }
  int root = n * (n + 1) / 2;
  for (int i = 1; i <= n - 1; i++) {
    int u, v;
    fin >> u >> v;
    g[u].push_back(v);
    root -= v;
  }
  dfs(root);
  for (int it : ord) {
    if (k[it] == 0) {
      answer[it] = 0;
    } else {
      int kth = it;
      for (int i = 0; i < MAX_LOG; i++) {
        if ((k[it] >> i) & 1) {
          kth = up[kth][i];
        }
      }
      answer[it] = answer[kth] + 1;
    }
  }
  for (int i = 1; i <= n; i++) {
    fout << answer[i] << " ";
  }
  return 0;
}