为啥re了

#include<bits/stdc++.h>
using namespace std;
const int N=1e5+5;
int n,m;
int t[N],c[N];
vector<int>col[N];
int head[N],to[N*2],nex[N*2],cnt;
void add(int u,int v){
	cnt++;
	to[cnt]=v;nex[cnt]=head[u];head[u]=cnt;
}
int fa[22][N],deep[N],tim,dfn[N],dfnr[N];
void dfs(int x){
	dfn[x]=++tim;
	deep[x]=deep[fa[x][0]]+1;
	for(int i=1;i<=log2(deep[x]);i++){
		fa[x][i]=fa[fa[x][i-1]][i-1];
	}
	for(int i=head[x];i;i=nex[i]){
		int y=to[i];if(y==fa[x][0])continue;
		fa[y][0]=x;dfs(y);
	}
	dfnr[x]=tim;
}
int lca(int x,int y){
	if(deep[y]>deep[x]){
		swap(x,y);
	}
	int d=deep[x]-deep[y];
	for(int i=0;i<=log2(d);i++){
		if((1<<i)&d){
			x=fa[x][i];
		}
	}
	if(x==y)return x;
	for(int i=log2(deep[x]);i>=0;i--){
		if(fa[x][i]!=fa[y][i]){
			x=fa[x][i];y=fa[y][i];
		}
	}
	return fa[x][0];
}
bool cmp(int a,int b){
	return dfn[a]<dfn[b];
}
struct node{
	int x,w;
};
vector<node>ed[N];
vector<int>q[N];
int dian[N*2],len;
vector<int>g[N];
bool in(int u,int v){
	if(dfn[v]>dfn[u]&&dfnr[v]>=dfn[u])return 1;
	return 0;
}
int get(int u,int v){
	for(int i=log2(deep[u]);i>=0;i--){
		if(fa[u][i]!=v)u=fa[u][i];
	}
	return u;
}
void add(int lu,int ru,int lv,int rv){
	node book;
	book.x=lu-1;book.w=-1;
	ed[lv].push_back(book);
	book.x=ru;
	ed[rv].push_back(book);
	book.w=1;book.x=ru;
	ed[lv].push_back(book);
	book.x=lu-1;
	ed[rv].push_back(book);
}
void ins(int u,int v){
	if(in(u,v)){
		v=get(u,v);
		add(dfn[u],dfnr[u],1,dfn[v]-1);add(dfn[u],dfnr[u],dfnr[v]+1,n);
	}else if(in(v,u)){
		u=get(v,u);
		add(1,dfn[u]-1,dfn[v],dfnr[v]);add(dfnr[u]+1,n,dfn[v],dfnr[v]);
	}else{
		add(dfn[u],dfnr[u],dfn[v],dfnr[v]);
	}
}
void df(int root,int x,int fa,int cnt){
	if(c[x]==c[root]){
		if(t[x]==1)cnt++;
		else cnt--;
	}
	if(!cnt){
		ins(root,x);return;
	}
	for(int i:g[x]){
		if(i==fa)continue;
		df(root,i,x,cnt);
	}
}
vector<int>id[N];
int tree[N];
void update(int x,int w){
	while(x<=n){
		tree[x]+=w;
		x+=(x&(-x));
	}
}
int ask(int x){
	cout<<1;
	int re=0;
	while(x){
		re+=tree[x];
		x-=(x&(-x));
	}
	return re;
}
int ans[N];
int main(){
	int num;
	cin>>n>>num;
	for(int i=1;i<=n;i++){
		cin>>t[i]>>c[i];col[c[i]].push_back(i);
	}
	for(int u,v,i=1;i<n;i++){
		cin>>u>>v;add(u,v);add(v,u);
	}
	dfs(1);
	for(int i=1;i<=n;i++){
		len=0;
		if(col[i].size()==0)continue;
		for(int j:col[i]){
			++len;m=len;
			dian[len]=j;
		}
		sort(dian+1,dian+1+m,cmp);
		for(int j=1;j<m;j++){
			dian[++len]=lca(dian[j],dian[j+1]);
		}
		dian[++len]=1;
		sort(dian+1,dian+1+len);len=unique(dian+1,dian+1+len)-dian-1;
		sort(dian+1,dian+1+len,cmp);
		for(int i=1;i<len;i++){
			g[lca(dian[i],dian[i+1])].push_back(dian[i+1]);
			g[dian[i+1]].push_back(lca(dian[i],dian[i+1]));
		}
		for(int i=1;i<=len;i++){
			if(t[dian[i]]==1){
				df(dian[i],dian[i],0,1);
			}
		}
	}
	for(int i=1;i<=num;i++){
		int u,v;
		cin>>u>>v;
		q[dfn[u]].push_back(dfn[v]);id[dfn[u]].push_back(i);
	}
	for(int i=1;i<=n;i++){
		for(int k=0;k<ed[i].size();k++){
			node j=ed[i][k];
			update(j.x,j.w);
		}
		for(int j=0;j<=q[i].size();j++){
			ans[id[i][j]]=ask(dfn[q[i][j]]);
		}
	}
	for(int i=1;i<=num;i++)cout<<ans[i]<<' ';
	return 0;
}