#include<bits/stdc++.h>
using namespace std;
int n,fa[20005],dis[20005];
int findfa(int x){
	if(x==fa[x])return x;
    int tmp=fa[x];
    fa[x]=findfa(fa[x]);
    dis[x]+=dis[tmp];
    return fa[x];
}
int main(){
	int T;cin>>T;
	while(T--){
	    cin>>n;
		for(int i=1;i<=n;i++)fa[i]=i;
		memset(dis,0,sizeof(dis));
		char op;int x,y;
		while(cin>>op&&op!='0'){
			if(op=='E'){
			    cin>>x;
				findfa(x);
				cout<<dis[x]<<endl;
			}
			else{
			    cin>>x>>y;
				fa[x]=y;
	            dis[x]+=abs(x-y)%1000;
			}
		}
	}
	return 0;
}

提交 N 次，仍让是WA，有没有大佬能救救我！