最后对加操作处理写的差分。

#include<bits/stdc++.h>
#define int long long
using namespace std;
const int N=1e6+10,M=998244353;
int n,m,t,f[N],cnt,ans[N],s[N],si[N],h[N];
pair<int,int> g[N];
struct node{
	char op;
	int x,y,id;
}o[N];
struct query{
	int op,x,id;
};
vector<query> q[N];
int find(int x){
	if(f[x]==x)return x;
	int r=find(f[x]);
	g[x]=max(g[x],g[f[x]]);
	return f[x]=r;
}
int find2(int x){
	return f[x]==x?x:find(f[x]);
}
void merge(int x,int y){
	x=find2(x),y=find2(y);
	if(x==y)return;
	if(si[x]<si[y])swap(x,y);
	f[y]=x;
	h[y]=s[x];
	si[x]+=si[y];
}
int query(int x){
	int ans=0;
	while(f[x]!=x)
		ans+=s[x]-h[x],x=f[x];
	return ans+s[x]-h[x];
}
signed main(){
	ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
	cin>>n>>m;
	for(int i=1;i<=n;i++)f[i]=i;
	cnt=n;
	for(int i=1;i<=m;i++){
		cin>>o[i].op>>o[i].x;
		o[i].id=i;
		if(o[i].op=='U'||o[i].op=='M')
			cin>>o[i].y;
		if(o[i].op=='Q'){
			find(o[i].x);
			q[g[o[i].x].first].push_back({-1,o[i].x,i}),
			q[i].push_back({1,o[i].x,i}),
			ans[i]+=g[o[i].x].second;
		}
		if(o[i].op=='M')
			f[find(o[i].y)]=f[find(o[i].x)]=++cnt,f[cnt]=cnt;
		if(o[i].op=='Z')
			g[find(o[i].x)]={i,0};
	}
	for(int i=1;i<=cnt;i++)f[i]=i,si[i]=1;
	for(int i=1;i<=m;i++){
		if(o[i].op=='U')
			merge(o[i].x,o[i].y);
		else if(o[i].op=='A')
			s[find2(o[i].x)]+=si[find2(o[i].x)];
		for(auto [op,x,id]:q[i])
			ans[id]+=op*query(x);
	}	
	for(int i=1;i<=m;i++)
		if(o[i].op=='Q')
			cout<<ans[i]<<'\n';	
	return 0;	
}