#include<bits/stdc++.h>
using namespace std;
using ll = long long;
const int N = 4e6 + 5, V = 5e5;//数组要足够大
vector<int>g[N];
int a[N], d[N], sz[N];
int ls[N << 2], rs[N << 2], cnt[N << 2], rt[N];
ll s[N << 2], ans[N];
int n, tot;
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]];
	}
}
void add(int u, int l, int r, int &p)
{
	if(!p)p = ++tot;
	if(l == r)
	{
		cnt[p] ^= 1;
		s[p] = 1ll * cnt[p] * l * l;
		return;
	}
	int mid = (l + r) / 2;
	if(u <= mid)add(u, l, mid, ls[p]);
	else add(u, mid + 1, r, rs[p]);
	push_up(p);
}
int merge(int u, int y, int l, int r)
{
	if(!u || !y)return u | y;
	if(l == r)
	{
		cnt[u] ^= cnt[y];
		s[u] = 1ll * cnt[u] * l * l;
		return u;
	}
	int mid = (l + r) / 2;
	ls[u] = merge(ls[u], ls[y], l, mid);
	rs[u] = merge(rs[u], rs[y], mid + 1, r);
	push_up(u);
	return u;
}
void dfs(int u)
{
	sz[u] = 1;
	for(auto v : g[u])
	{
		dfs(v);
		sz[u] += sz[v];
	}
}
void solve(int u)
{
	if(g[u].empty())//叶子节点
	{
		add(a[u], 1, V, rt[u]);
		return;
	}
	int y1 = g[u][0], y2 = g[u][1];
	if(sz[y1] < sz[y2])swap(y1, y2);
	solve(y1);
	solve(y2);
	ll k1 = s[rt[y1]], k2 = s[rt[y2]];
	rt[u] = merge(rt[y1], rt[y2], 1, V);
	ll k3 = s[rt[u]];
	ans[u] = (k1 + k2 - k3) >> 1;
}
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]++;
	}
	for(int i = n + 1; i < (n / 2); i++)
	{
		if(!d[i])
		{
			dfs(i);
			solve(i);
		}
	}
	for(int i = n + 1; i < (n / 2); i++)
	{
		printf("%lld\n", ans[i] * 4);
	}
	return 0;
}