#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define INF 1e15

inline ll read()
{
	ll x = 0, f = 1;
	char c = getchar();
	while(c < '0' || c > '9')
	{
		if(c == '-')
		{
			f = -1;
		}
		c = getchar();
	}
	while(c >= '0' && c <= '9')
	{
		x = (x << 1) + (x << 3) + c - '0';
		c = getchar();
	}
	return x * f;
}

const int N = 4e6 + 5, V = 1e6;

vector<int>g[N];

int n;
int a[N], d[N];

ll tot;
int ls[N << 2], rs[N << 2], s[N << 2], cnt[N << 2];
ll ans[N], rt[N];

void dlt(int p)
{
	ls[p] = rs[p] = s[p] = cnt[p] = 0;
}
void push_up(int p)
{
	cnt[p] = cnt[ls[p]] + cnt[rs[p]];
	if(cnt[rs[p]] % 2 == 1)
	{
		s[p] = s[rs[p]] - s[ls[p]];
	}
	else
	{
		s[p] = s[rs[p]] + s[ls[p]];
	}
}
ll add(int id, int u, int l, int r)
{
	if(!id)
	{
		id = ++tot;
	}
	if(l == r)
	{
		cnt[id] ^= 1;
		s[id] = 1ll * cnt[id] * l * l;
		return id;
	}
	int mid = (l + r) / 2;
	if(u <= mid)
	{
		ls[id] = add(ls[id], u, l, mid);
	}
	else
	{
		rs[id] = add(rs[id], u, mid + 1, r);
	}
	push_up(id);
	return id;
}
int merge(int a, int b, int l, int r)
{
	if(!a)
	{
		return b;
	}
	if(!b)
	{
		return a;
	}
	if(l == r)
	{
		cnt[a] ^= cnt[b];
		s[a] = 1ll * cnt[a] * l * l;
		dlt(b);
		return a;
	}
	int mid = (l + r) / 2;
	ls[a] = merge(ls[a], ls[b], l, mid);
	rs[a] = merge(rs[a], rs[b], mid + 1, r);
	push_up(a);
	dlt(b);
	return a;
}
void solve(int u)
{
	if(g[u].empty())//叶子节点
	{
		rt[u] = add(rt[u], a[u], 1, V);
		return;
	}
	int v1 = g[u][0], v2 = g[u][1];
	solve(v1);
	solve(v2);
	ll k1 = s[rt[v1]];
	ll k2 = s[rt[v2]];
	rt[u] = merge(rt[v1], rt[v2], 1, V);
	ll k3 = s[rt[u]];
	ans[u] = (k1 + k2 - k3) / 2 * 4;
}
int main()
{
	cin >> n;
	for(int i = 1; i <= n; i++)
	{
		cin >> a[i];
		a[i] /= 2;
	}
	for(int i = 1; i < n; i++)
	{
		int u, v;
		cin >> u >> v;
		g[n + i].push_back(u);
		g[n + i].push_back(v);
		d[u]++;
		d[v]++;
	}
	ll root = -1;
	for(int i = n + 1; i < n * 2; i++)
	{
		if(!d[i])//根节点
		{
			root = i;
			break;
		}
	}
	solve(root);
	for(int i = n + 1; i < (n * 2); i++)
	{
		printf("%lld\n", ans[i]);
	}
	return 0;
}