//#define LOCAL

 #include <algorithm>

 #include <cstdio>

 using namespace std;

 const int maxn =  + ;

 int parent[maxn], distant[maxn];

 int GetParent(int a)

 {

     if(parent[a] == a)    return a;

     int root = GetParent(parent[a]);

     distant[a] += distant[parent[a]];

     return parent[a] = root;

 }

 int main(void)

 {

     #ifdef LOCAL

         freopen("3027in.txt", "r", stdin);

     #endif

     int T, n;

     scanf("%d", &T);

     while(T--)

     {

         scanf("%d", &n);

         char cmd[];

         for(int i = ; i <= n; ++i)

         {

             parent[i] = i;

             distant[i] = ;

         }

         while(scanf("%s", cmd) && cmd[] != 'O')

         {

             int a, b;

             if(cmd[] == 'E')

             {

                 scanf("%d", &a);

                 GetParent(a);

                 printf("%d\n", distant[a]);

             }

             else

             {

                 scanf("%d%d", &a, &b);

                 parent[a] = b;

                 distant[a] = abs(a - b) % ;

             }

         }

     }

     return ;

 }