#include<iostream>
 #include<cstring>
 #include<cmath>
 using namespace std;
 ;
 int T,n,level,d[maxn],fa[maxn];
 void init()
 {
     memset(d,,sizeof(d));
     ;i<=n;i++) fa[i]=i;
 }
 int find(int x){
     if(fa[x]==x) return x;
     int ans=find(fa[x]);
     level+=d[x];
     d[x]=level;
     fa[x]=ans;
     return ans;
 }
 int main()
 {
     char op;
     cin>>T;
     while(T--){
         cin>>n;
         init();
         while(cin>>op){
             if(op=='O') break;
             else if(op=='I'){
                 int u,v;
                 cin>>u>>v;
                 d[u]=abs(u-v)%,fa[u]=v;
             }else if(op=='E'){
                 int x;cin>>x;
                 if(fa[x]==x){
                     cout<<<<endl;continue;
                 }
                 level=;
                 find(x);
                 cout<<d[x]<<endl;
             }
         }
     }
     ;
 }