D. Tree and Queries(dsu

#include <bits/stdc++.h>
using namespace std;
// #define int long long
const int N=1e6+10;
struct BIT{
    int n,c[N];//n为所维护的bit的范围，注意不要混用，离散化时会改变范围
    void init(int _n){n=_n;for(int i=1;i<=n;++i) c[i]=0;}
    int lowbit(int x){return x&(-x);}//负数为对应正数二进制保留最低位1及之前的0不变，其它取反 故该操作可获得x最位为1对应的值（2的几次方）
    int get_sum(int k){int ans=c[k];while((k-=lowbit(k))>0) ans+=c[k];return ans;}
    void add(int t,int v){c[t]+=v;while((t+=lowbit(t))<=n) c[t]+=v;}
}bit1;
struct edge{
	int to,nxt;
}d[N*2]; int head[N*2],cnt=1;
void add(int u,int v){	d[++cnt]=(edge){v,head[u]},head[u]=cnt; }
typedef pair<int,int>p;
vector<p>vec[N];
int n,m,son[N],siz[N],deep[N];int an[N];
void dfs(int u,int father,int depth){
	siz[u]=1,deep[u]=depth;
	int maxson=-1;
	for(int i=head[u];i;i=d[i].nxt ){
		int v=d[i].to;
		if( v==father )	continue;
		dfs(v,u,depth+1);
		siz[u]+=siz[v];
		if( maxson<siz[v] )	maxson=siz[v],son[u]=v;
	}
}
int nowson,shu[N];int col[N],cntcol[N];
void update(int u,int father,int val){
    cntcol[col[u]]+=val;
    if(cntcol[col[u]]>0) bit1.add(cntcol[col[u]],1);
    if(cntcol[col[u]]-val>0) bit1.add(cntcol[col[u]]-val,-1);
    for(int i=head[u];i;i=d[i].nxt){
        int v=d[i].to;
        if(v==father||v==nowson) continue;
        update(v,u,val);
    }
}

void dsu(int u,int father,bool keep){
	for(int i=head[u];i;i=d[i].nxt){
        int v=d[i].to;
        if(v==father||v==son[u]) continue;
        dsu(v,u,0);
    }
    if(son[u]) dsu(son[u],u,1),nowson=son[u];
    update(u,father,1);nowson=0;
    // cout<<1<<endl;
    for(int i=0;i<vec[u].size();i++){
        auto tp=vec[u][i];
        an[tp.second]=bit1.get_sum(N-1)-bit1.get_sum(tp.first-1);
    }
    if(keep==0) update(u,father,-1);
}

int main(){
    scanf("%d%d",&n,&m);
    bit1.init(N-1);
    for(int i=1;i<=n;i++) scanf("%d",&col[i]);
    for(int i=1;i<n;i++){
        int x,y;scanf("%d%d",&x,&y);
        add(x,y);add(y,x);
    }
    for(int i=1;i<=m;i++){
        int u,k;scanf("%d%d",&u,&k);
        vec[u].push_back({k,i});
    }
    dfs(1,0,1);
    // cout<<1<<endl;
    dsu(1,0,1);
    for(int i=1;i<=m;i++){
        printf("%d\n",an[i]);
    }
}