#include <bits/stdc++.h>
using namespace std;
// #include <ext/pb_ds/assoc_container.hpp>
// #include <ext/pb_ds/tree_policy.hpp>
// using namespace __gnu_pbds;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii ;
typedef pair<ll, ll> pll ;
typedef vector<pii> vii ;
typedef vector<int> veci ;
typedef vector<pll> vll ;
typedef vector<ll> vecll;
// find_by_order order_of_key
//#pragma GCC optimize("O3,unroll-loops")
//#pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")
#define ordered_set tree<int, null_type,less<int>, rb_tree_tag,tree_order_statistics_node_update>
#define F first
#define S second
#define pb push_back
#define endl '\n'
#define Mp make_pair
#define all(x) x.begin(), x.end()
#define debug(x) cerr << #x << " = " << x << endl
#define set_dec(x) cout << fixed << setprecision(x);
#define fast_io ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
#define file_io freopen("in.txt" , "r" , stdin) ; freopen("out.txt" , "w" , stdout);
#define lb lower_bound
#define ub upper_bound
#define for1(n) for(int i=1;i<=n;i++)
#define for0(n) for(int i=0;i<n;i++)
#define forn(n) for(int i=n;i>0;i--)
#define pq priority_queue <pii, vector<pii>, greater<pii>>
const ll mod = 1e9+7 ;// 998244353 ;// 1e9+9;
ll inf=1e18;
const int N=1<<17;
int A[N],n,sz[N],par[N],head[N],st[N],t,pos[N],fen[N];
vector<int>g[N],vecc;
int seg[N*2];
vector<pii>vec;
void updd(int i,int x){
for(;i<vecc.size();i+=i&-i)fen[i]+=x;
}
int gett(int i){
int ans=0;
for(;i>0;i-=i&-i)ans+=fen[i];
return ans;
}
void build(int l=1,int r=n+1,int v=1){
if(r-l==1){
seg[v]=A[pos[l]];
return;
}
int mid=(l+r)>>1;
build(l,mid,v<<1);
build(mid,r,v<<1|1);
seg[v]=(seg[v<<1]==seg[v<<1|1] ? seg[v<<1]:0);
}
void upd(int lx,int rx,int x,int l=1,int r=n+1,int v=1){
if(lx>=r || rx<=l)return;
if(lx<=l && r<=rx){
seg[v]=x;
return;
}
int mid=(l+r)>>1;
upd(lx,rx,x,l,mid,v<<1);
upd(lx,rx,x,mid,r,v<<1|1);
seg[v]=(seg[v<<1]==seg[v<<1|1] ? seg[v<<1]:0);
}
void get(int lx,int rx,int l=1,int r=n+1,int v=1){
if(lx>=r || rx<=l)return;
if(seg[v]){
if(vec.size()==0 || vec.back().F!=seg[v])
vec.pb({seg[v],min(r,rx)-max(l,lx)});
else
vec.back().S+=min(r,rx)-max(l,lx);
return;
}
int mid=(l+r)>>1;
get(lx,rx,mid,r,v<<1|1);
get(lx,rx,l,mid,v<<1);
}
ll get_ans(int v){
int x=A[v];
v=par[v];
while(v!=0){
get(st[head[v]],st[v]+1);
upd(st[head[v]],st[v]+1,x);
v=par[head[v]];
}
ll ans=0;
for(pii p:vec){
updd(p.F,p.S);
ans+=1ll*gett(p.F-1)*p.S;
}
for(pii p:vec)updd(p.F,-p.S);
vec.clear();
return ans;
}
void DFS(int v){
sz[v]=1;
for(int u:g[v]){
par[u]=v;
DFS(u);
sz[v]+=sz[u];
}
}
void dfs(int v){
st[v]=++t;pos[t]=v;
pii mx={0,0};
for(int u:g[v])
mx=max(mx,{sz[u],u});
if(mx.F!=0){head[mx.S]=head[v];dfs(mx.S);}
for(int u:g[v])if(u!=mx.S){
head[u]=u;
dfs(u);
}
}
int main(){
fast_io
cin>>n;
vecc.pb(-1);
for1(n){cin>>A[i];vecc.pb(A[i]);}
sort(all(vecc));vecc.resize(unique(all(vecc))-vecc.begin());
for1(n)A[i]=lb(all(vecc),A[i])-vecc.begin();
vector<int>nod;
for1(n-1){
int u,v;cin>>u>>v;
g[u].pb(v);
nod.pb(v);
}
DFS(1);
head[1]=1;
dfs(1);
build();
for(int v:nod)
cout<<get_ans(v)<<endl;
}
