#include<bits/stdc++.h>
using namespace std;
bool M1;
#define PI 3.14159265358979323846
#define sz(a) (int)a.size()
#define all(x) x.begin(),x.end()
#define ii pair<int,int>
#define iii pair<int,ii>
#define iv pair<ii,ii>
#define se second
#define fi first
#define ffi fi.fi
#define sfi se.fi
#define sse se.se
#define fse fi.se
#define lt(i, c, d) for(int i = c; i <= d; ++i)
#define fl(i, c, d) for(int i = d; i >= c; --i)
#define pb push_back
#define emb emplace_back
#define emf emplace_front
#define em emplace
#define int long long
#define look_memory cerr<<abs(&M2-&M1)/1024.0/1024<<'\n'
#define look_time cerr << "TIME : " << clock() * 0.001 << "s" <<'\n'
const int N=1e6+5,lg=30,mod=1e9+7;
mt19937 rd(chrono::steady_clock::now().time_since_epoch().count());
int Rand(int u,int v){
return u+rd()%(v-u+1);
}
int dx[]={1,0,-1,0,1,1,-1,-1};
int dy[]={0,-1,0,1,1,-1,1,-1};
int node,a[N];
struct HLD {
int n, curpos, curc;
vector<int> st, bit, sl, h, up, curhead, curid, pos, posend, arr;
vector<vector<int>> edge;
HLD() : curpos(0), curc(0) {};
HLD(int _n) : n(_n), st(n * 4 + 5, -1), bit(n+5, 0), sl(n + 5), h(n + 5), up(n + 5),
curhead(n + 5), curid(n + 5), pos(n + 5), posend(n+5), arr(n + 5), edge(n + 5) {
curpos = curc = 0;
};
void addedge(int u, int v) {
edge[u].emplace_back(v);
edge[v].emplace_back(u);
}
void down(int id) {
if(st[id]==-1)return;
st[id<<1]=st[id];
st[id<<1|1]=st[id];
}
void merge(int id){
if(st[id<<1]==st[id<<1|1])st[id]=st[id<<1];
else st[id]=-1;
}
void update(int id, int l, int r, int u,int v, int val) {
if(r<u||l>v)return;
if (u<=l&&r<=v) {
// cout <<id<<" "<<val<<" "<<u<<" "<<v<<'\n';
st[id] =val;
return;
}
down(id);
int mid = (l + r) >> 1;
update(id << 1, l, mid, u,v, val);
update(id << 1 | 1, mid + 1, r, u,v, val);
merge(id);
}
void updatebit(int idx,int val){
while(idx<=n){
bit[idx]+=val;
idx+=idx&-idx;
}
}
int getbit(int idx){
int res=0;
while(idx>0){
res+=bit[idx];
idx-=idx&-idx;
}
return res;
}
vector<ii>rec;
int get(int id, int l, int r, int u, int v) {
if (r < u || l > v) return 0;
if (l >= u && r <= v&&st[id]!=-1){
int res=getbit(st[id]-1)*(r-l+1);
// cout <<l<<" "<<r<<" "<<st[id]<<" "<<res<<'\n';
updatebit(st[id],r-l+1);
rec.emb(st[id],r-l+1);
return res;
}
if(l==r)return 0;
down(id);
int mid = (l + r) >> 1;
return get(id << 1 | 1, mid + 1, r, u, v)+get(id << 1, l, mid, u, v) ;
}
void del(int idx){
while(idx<=n){
bit[idx]+=0;
idx+=idx&-idx;
}
}
void dfs(int u, int cha) {
sl[u] = 1;
for (int v : edge[u]) {
if (v == cha) continue;
h[v] = h[u] + 1;
up[v] = u;
dfs(v, u);
sl[u] += sl[v];
}
}
void hld(int u, int cha) {
if (!curhead[curc]) curhead[curc] = u;
curid[u] = curc;
pos[u] = ++curpos;
arr[curpos] = u;
int nxt = 0;
for (int v : edge[u]) {
if (v != cha && sl[v] > sl[nxt]) nxt = v;
}
if (nxt) hld(nxt, u);
for (int v : edge[u]) {
if (v != cha && v != nxt) {
++curc;
hld(v, u);
}
}
posend[u]=curpos;
}
void build(int goc){
dfs(goc,-1);
hld(goc,-1);
}
int change(int j){
int tmp=a[j];
update(1,1,n,pos[j],pos[j],tmp);
j=up[j];
// for(int i=1;i<=node;++i)cout <<pos[i]<<" "<<curhead[curid[i]]<<'\n';cout<<'\n';
int ans=0;
while(j){
// cout<<pos[curhead[curid[j]]]<<" "<<pos[j]<<" "<<get(1,1,n,pos[curhead[curid[j]]],pos[j])<<'\n';
ans+=get(1,1,n,pos[curhead[curid[j]]],pos[j]);
// cout pos[curhead[curid[j]]],pos[j]
update(1,1,n,pos[curhead[curid[j]]],pos[j],tmp);
j=up[curhead[curid[j]]];
}
for(auto x:rec)updatebit(x.fi,-x.se);
rec.clear();
return ans;
}
};
ii b[N];
bool M2;
void solve(){
cin >> node;
HLD hld(node);
vector<int>nen;
for(int i=1;i<=node;++i){
cin >> a[i];
nen.emb(a[i]);
}
sort(all(nen));
nen.erase(unique(all(nen)),nen.end());
for(int i=1;i<node;++i){
int u,v;
cin >> u >> v;
hld.addedge(u,v);
b[i]={u,v};
}
hld.build(1);
hld.change(1);
for(int i=1;i<node;++i){
// hld.change(b[i].se);
cout<<hld.change(b[i].se)<<'\n';
}
// cout <<1;
}
main()
{
srand(time(0));
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
#define task "aws"
if(fopen(task".inp","r")){
freopen(task".inp","r",stdin);
freopen(task".out","w",stdout);
}
int t=1;
// cin >> t;
while(t--){
solve();cout<<'\n';
}
look_memory;
look_time;
}
