D - Lomsat gelral

You are given a rooted tree with root in vertex 1. Each vertex is coloured in some colour.

Let’s call colour c dominating in the subtree of vertex v if there are no other colours that appear in the subtree of vertex v more times than colour c. So it’s possible that two or more colours will be dominating in the subtree of some vertex.

The subtree of vertex v is the vertex v and all other vertices that contains vertex v in each path to the root.

For each vertex v find the sum of all dominating colours in the subtree of vertex v.

Input
The first line contains integer n (1 ≤ n ≤ 105) — the number of vertices in the tree.

The second line contains n integers ci (1 ≤ ci ≤ n), ci — the colour of the i-th vertex.

Each of the next n - 1 lines contains two integers xj, yj (1 ≤ xj, yj ≤ n) — the edge of the tree. The first vertex is the root of the tree.

Output
Print n integers — the sums of dominating colours for each vertex.

Examples
Input
4
1 2 3 4
1 2
2 3
2 4
Output
10 9 3 4
Input
15
1 2 3 1 2 3 3 1 1 3 2 2 1 2 3
1 2
1 3
1 4
1 14
1 15
2 5
2 6
2 7
3 8
3 9
3 10
4 11
4 12
4 13
Output
6 5 4 3 2 3 3 1 1 3 2 2 1 2 3
给你一颗树，1是根节点，每个结点的颜色是一个数字，询问每个结点子树上结点颜色的众数和。
在每个结点上开一个map记录颜色，并且两个数组分别记录众数和还有众数出现的次数，启发式合并时不断更新。

#include<bits/stdc++.h>
#define ll long long
using namespace std;
const int N=1e5+5;
map<int,int> m[N];
map<int,int>::iterator it;
vector<int> edge[N];
ll ans[N];
ll sum[N];
int num[N];
int rt[N];

int merge(int x,int y)
{
	if(m[x].size()<m[y].size())
	swap(x,y);
	for(it=m[y].begin();it!=m[y].end();it++)
	{
		m[x][it->first]+=it->second;
		if(num[x]==m[x][it->first])
		sum[x]+=1ll*(it->first);
		if(num[x]<m[x][it->first])
		sum[x]=1ll*(it->first),num[x]=m[x][it->first];
	}
	return x;
}

void dfs(int x,int fa)
{
	for(int i=0;i<edge[x].size();i++)
	{
		if(edge[x][i]==fa)
		continue;
		dfs(edge[x][i],x);
	}
	
	for(int i=0;i<edge[x].size();i++)
	{
		if(edge[x][i]==fa)
		continue;
		rt[x]=merge(rt[x],rt[edge[x][i]]);
		ans[x]=sum[rt[x]];
	}
}

int n,c,x,y;
int main()
{
	scanf("%d",&n);
	for(int i=1;i<=n;i++)
	{
		scanf("%d",&c);
		rt[i]=i;
		m[i][c]++;
		ans[i]=1ll*c;
		sum[i]=1ll*c;
		num[i]=1;
	}
	for(int i=1;i<n;i++)
	{
		scanf("%d%d",&x,&y);
		edge[x].push_back(y);
		edge[y].push_back(x);
	}
	dfs(1,0);
	for(int i=1;i<n;i++)
	printf("%lld ",ans[i]);
	printf("%lld\n",ans[n]);
}