#include <cstdio>
#include <vector>
#include <cctype>
#include <cstring>

using namespace std;

class InParser {
private:
  FILE *fin;
  char *buff;
  int sp;

  char read_ch() {
    ++sp;
    if (sp == 4096) {
      sp = 0;
      fread(buff, 1, 4096, fin);
    }
    return buff[sp];
  }

public:
  InParser(const char* nume) {
    fin = fopen(nume, "r");
    buff = new char[4096]();
    sp = 4095;
  }

  InParser& operator >> (int &n) {
    char c;
    while (!isdigit(c = read_ch()) && c != '-');
    int sgn = 1;
    if (c == '-') {
      n = 0;
      sgn = -1;
    } else {
      n = c - '0';
    }
    while (isdigit(c = read_ch())) {
      n = 10 * n + c - '0';
    }
    n *= sgn;
    return *this;
  }
};

class OutParser {
private:
    FILE *fout;
    char *buff;
    int sp;

    void write_ch(char ch) {
        if (sp == 50000) {
            fwrite(buff, 1, 50000, fout);
            sp = 0;
            buff[sp++] = ch;
        } else {
            buff[sp++] = ch;
        }
    }


public:
  OutParser(const char* name) {
    fout = fopen(name, "w");
    buff = new char[50000]();
    sp = 0;
  }
  ~OutParser() {
    fwrite(buff, 1, sp, fout);
    fclose(fout);
  }

  OutParser& operator << (int vu32) {
    if (vu32 <= 9) {
      write_ch(vu32 + '0');
    } else {
      (*this) << (vu32 / 10);
      write_ch(vu32 % 10 + '0');
    }
    return *this;
  }

  OutParser& operator << (char ch) {
    write_ch(ch);
    return *this;
  }
  OutParser& operator << (const char *ch) {
    while (*ch) {
      write_ch(*ch);
      ++ch;
    }
    return *this;
  }
};

vector<int>G[100005];
int k[100005];
bool r[100005];
int ans[100005];
int st[100005];

void dfs(int node, int lvl) {
  st[lvl] = node;
  if (k[node] != 0)
    ans[node] = 1 + ans[st[lvl - k[node]]];
  for (auto it:G[node])
    dfs(it, lvl + 1);
}

int main() {
  InParser fin("cerere.in");
  OutParser fout("cerere.out");


  int n;
  fin >> n;
  for (int i = 1; i <= n; ++i)
    fin >> k[i];
  for (int i = 1; i < n; ++i) {
    int u, v;
    fin >> u >> v;
    G[u].push_back(v);
    r[v] = 1;
  }
  int root = 0;
  for (int i = 1; i <= n && !root; ++i)
    if (!r[i])
      root = i;
  dfs(root, 1);

  for (int i = 1; i <= n; ++i)
    fout << ans[i] << ' ';

  return 0;
}