#include <vector>
#include <list>
#include <map>
#include <set>
#include <deque>
#include <queue>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <utility>
#include <sstream>
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <cctype>
#include <string>
#include <cstring>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <ctime>
#include <fstream>
#include <iterator>
#include <random>
#include <assert.h>
using namespace std;


const string file = "cerere";

const string infile = file + ".in";
const string outfile = file + ".out";

const int INF = 0x3f3f3f3f;



void Solve(int root, vector<vector<int> >& G, vector<int>& K, vector<int>& R, vector<int>& level)
{
	stack<pair<int, int> > stiva;
	stiva.push(make_pair(root, 0));
	
	while(stiva.empty() == false)
	{
		pair<int, int> c = stiva.top();
		stiva.pop();

		int x = c.first;
		int l = c.second;

		level[l] = x;

		if(K[x] != 0)
		{
			R[x] = R[level[l - K[x]]] + 1;
		}

		for(vector<int>::iterator itr = G[x].begin();
			itr != G[x].end();
			itr++)
		{
			stiva.push(make_pair(*itr, l + 1));
		}

	}
	

	
}

int main()
{
#ifdef ONLINE_JUDGE
	ostream &fout = cout;
	istream &fin = cin;
#else
	fstream fout(outfile.c_str(), ios::out);
	fstream fin(infile.c_str(), ios::in);
#endif	

	int N;
	fin >> N;

	vector<int> K;
	K.resize(N + 1, 0);
	vector<int> R;
	R.resize(N + 1, 0);

	vector<vector<int> > G;
	G.resize(N + 1);

	for(int i = 1; i <= N; i++)
	{
		fin >> K[i];
	}
	vector<int> level(N);
	vector<bool> isChild;
	isChild.resize(N + 1, false);

	for(int i = 0; i < N - 1; i++)
	{
		int x, y;
		fin >> x >> y;
		G[x].push_back(y);
		isChild[y] = true;
	}

	int root = 0;
	for(int i = 1; i <= N; i++)
	{
		if(isChild[i] == false)
		{
			root = i;
			break;
		}
	}

	Solve(root, G, K, R, level);

	copy(R.begin() + 1, R.end(), ostream_iterator<int>(fout, " "));
	fout << "\n";


#ifdef ONLINE_JUDGE
#else

	fin.close();
	fout.close();
#endif
}