#include <stdio.h>
#define MAX_NUM 10010
int N,Q;
//记录城市内龙珠数目
int city[MAX_NUM];
//球指向的集合
int root[MAX_NUM];

int trans_times[MAX_NUM];

int find_root(int a)
{
    if(root[a]==a)return a;
    else{
        int tem = root[a];
        root[a]=find_root(root[a]);
        trans_times[a] += trans_times[tem];//更新传输次数
        //改城市的球被转移到了root下，
        //那么这个城市的球数量减少1，而根城市的球的数量加1
        return root[a];
    }
}

void union_set(int a,int b)
{
    int x = find_root(a);
    int y = find_root(b);
    if(x==y)return;
    else{
        city[y] += city[x];
        root[x] = y;
        trans_times[x]++;
    }
}
void init()
{
    for(int i = 0; i <= N; i++)
    {
        root[i] = i;
        city[i] = 1;
        trans_times[i]=0;
    }
}

int main()
{
    int T;
    int x,y,fx,fy,z;
    char op;
    scanf("%d",&T);
    for(int t = 1; t <= T; t++)
    {
        scanf("%d %d",&N,&Q);
        init();
        printf("Case %d:\n",t);
        while(Q--)
        {
            getchar();
            scanf("%c",&op);
           // printf("%c",op);
            if(op=='T')
            {
                scanf("%d%d",&x,&y);
                fx = find_root(x);
                fy = find_root(y);
                if(fx!=fy)
                union_set(x,y);
            }else{
                scanf("%d",&z);
                find_root(z);
                printf("%d %d %d\n",root[z],city[root[z]],trans_times[z]);
            }
        }

    }
    return 0;
}