#include<fstream>
#define N 100100
#include<vector>
using namespace std;
ifstream f("cerere.in");
ofstream g("cerere.out");
int sol[N],s[N],i,x,y,t,k[N],n;
vector<int> v[N];
void dfs(int x)
{
	s[++t]=x;
	if(k[x])
	sol[x]+=sol[s[t-k[x]]]+1;
	for(int i=0;i<v[x].size();++i)
		dfs(v[x][i]);
	--t;
}
int main ()
{
	f>>n;
	for(i=1;i<=n;++i)
		f>>k[i];
	for(i=1;i<n;++i)
	{
		f>>x>>y;
		v[x].push_back(y);
	}
	for(i=1;i<=n;++i)
		if(!k[i])
			dfs(i);
	for(i=1;i<=n;++i)
		g<<sol[i]<<" ";
	return 0;
}