#include <bits/stdc++.h>
#define L 100005
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;
	}

	InParser& operator >> (long long &n) {
		char c;
		n = 0;
		while (!isdigit(c = read_ch()) && c != '-');
		long long 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 << (long long vu64) {
        if (vu64 <= 9) {
            write_ch(vu64 + '0');
        } else {
            (*this) << (vu64 / 10);
            write_ch(vu64 % 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;
    }
};

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

int up[L], lev[L], v[L], ans[L], res[L], n, root, j;
bool vis[L];
vector <int> G[L], LEV[L];

inline void clear_vis(){
  int i;
  for (i = 0; i <= n; i++)
    vis[i] = false;
  lev[root] = 1;
  LEV[1].push_back(root);
}

inline void DFS(int node){
  vis[node] = true;
  v[j] = node;
  ans[node] = v[j - up[node]];
  j++;
  for (auto it : G[node])
    if (!vis[it]){
      lev[it] = lev[node] + 1;
      LEV[lev[it]].push_back(it);
      DFS(it);
    }
  j--;
}

int main(){
  int i, x, y;
  fin >> n;
  for (i = 1; i <= n; i++)
    fin >> up[i];
  for (i = 1; i < n; i++){
    fin >> x >> y;
    G[x].push_back(y);
    vis[y] = true;
  }
  i = 1;
  while (vis[i++]);
  root = i - 1;
  clear_vis();
  DFS(root);
  for (i = 1; i <= n; i++)
    for (auto it : LEV[i])
      if (ans[it] == it)
        res[it] = 0;
      else
        res[it] = 1 + res[ans[it]];
  for (i = 1; i <= n; i++)
    fout << res[i] << " ";
  fout << "\n";
  return 0;
}