#include <stdio.h>
#include <bits/stdc++.h>
#include <atcoder/all>
using namespace atcoder;
using mint = modint998244353;
using namespace std;
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define Inf32 1000000001
#define Inf64 1000000000000000001

long long a[200005];
vector<vector<int>> E;
vector<long long> t;
fenwick_tree<long long> Fc(200005),Fs(200005);
long long ans[200005];
int ma = 200005;
void dfs(int cv,int pv){
	Fc.add(a[cv],1);
	Fs.add(a[cv],t[a[cv]]);
	
	if(Fc.sum(0,200005)<=2)ans[cv] = -1;
	else{
		int mini,maxi;
		{
			int ok = 0,ng = ma;
			while(ng-ok>1){
				int mid = (ok+ng)/2;
				if(Fc.sum(0,mid)==0)ok = mid;
				else ng = mid;
			}
			mini = ok+1;
		}
		{
			int ok = 0,ng = ma;
			while(ng-ok>1){
				int mid = (ok+ng)/2;
				if(Fc.sum(mid,ma)>0)ok = mid;
				else ng = mid;
			}
			maxi = ok;
		}
		if(mini==maxi){
			ans[cv] = 1;
		}
		else{
			ans[cv] = Inf64;
			
			rep(_,2){
				Fc.add(mini,-1);
				Fs.add(mini,-t[mini]);
				long long num = Fc.sum(0,ma);
				int ok = ma,ng = 0;
				while(ok-ng>1){
					int mid = (ok+ng)/2;
					if(Fc.sum(0,mid)>=(num+1)/2)ok = mid;
					else ng = mid;
				}
				ok--;
				/*
				if(cv==4){
				cout<<"hoge"<<t[ok]<<endl;
				}
				*/
				
				long long tt =0;
				tt += t[ok] * Fc.sum(0,ok);
				tt -= Fs.sum(0,ok);
				tt -= t[ok] * Fc.sum(ok,ma);
				tt += Fs.sum(ok,ma);
				ans[cv] = min(ans[cv],tt);
				Fc.add(mini,1);
				Fs.add(mini,t[mini]);
				swap(mini,maxi);
			}
			
			
		}
	}
	rep(i,E[cv].size()){
		int to = E[cv][i];
		if(to==pv)continue;
		dfs(to,cv);
	}
	Fc.add(a[cv],-1);
	Fs.add(a[cv],-t[a[cv]]);
}

int main(){
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	int n;
	cin>>n;
	E.resize(n+1);
	rep(i,n+1)cin>>a[i];
	rep(i,n){
		int u,v;
		cin>>u>>v;
		E[u].push_back(v);
		E[v].push_back(u);
	}

	rep(i,n+1)t.push_back(a[i]);
	sort(t.begin(),t.end());
	t.erase(unique(t.begin(),t.end()),t.end());
	rep(i,n+1){
		a[i] = distance(t.begin(),lower_bound(t.begin(),t.end(),a[i]));
	}
	
	dfs(0,-1);
	for(int i=1;i<=n;i++){
		cout<<ans[i]<<endl;
	}
	return 0;
}