#include <bits/stdc++.h>
#define LL long long
using namespace std;
const int MAXN = 2e4 + 5;
const int INF = 0x3f3f3f3f;
 
int dis[MAXN], p[MAXN];
 
int Find(int x)
{
    if (p[x] == x)
        return x;
    int root = Find(p[x]);
    dis[x] += dis[p[x]];
    return p[x] = root;
}
 
int main()
{
    //freopen("input.txt", "r", stdin);
    int T, i, j, n, a, b;
    char ch[10];
    scanf("%d", &T);
    while (T--)
    {
        scanf("%d%*c", &n);
        for (i = 1; i <= n; i++)
        {
            p[i] = i;
            dis[i] = 0;
        }
        while (scanf("%s", ch) && ch[0] != 'O')
        {
            if (ch[0] == 'E')
            {
                scanf("%d", &a);
                Find(a);
                printf("%d\n", dis[a]);
            }
            else
            {
                scanf("%d%d", &a, &b);
                p[a] = b;
                dis[a] = abs(a - b) % 1000;
            }
        }
    }
    return 0;
}