#include<iostream>
#include<cstdio>
#include<cstring>
#include<string>
#include<cstdlib>
#include<algorithm>
#include<cstdlib>
using namespace std;
#define maxn 1000010
int n,tt,m,fa[maxn],city[maxn],trans[maxn];
char s[10];
int find(int x)
{
      if(x==fa[x])
            return x;
      int k=fa[x];
      fa[x]=find(fa[x]);
      trans[x]+=trans[k];
      return fa[x];
}
void Union(int x,int y)
{
      int fx,fy;
      fx=find(x),fy=find(y);
      if(fx!=fy)
      {
            fa[fx]=fy;
            trans[fx]++;
            city[fy]+=city[fx];
            city[fx]=0;
      }
}
int main()
{
      int a,b,cas=1;
      scanf("%d",&tt);
      while(tt--)
      {
            printf("Case %d:\n",cas);
            scanf("%d%d",&n,&m);
            for(int i=0;i<=n;i++)
                  fa[i]=i,city[i]=1,trans[i]=0;
            for(int i=0;i<m;i++)
            {
                  scanf("%s",s);
                  if(s[0]==‘T‘)
                  {
                       scanf("%d%d",&a,&b);
                       Union(a,b);
                  }
                  else if(s[0]==‘Q‘)
                  {
                        scanf("%d",&a);
                        int k=find(a);
                        printf("%d %d %d\n",k,city[k],trans[a]);
                  }
            }
            cas++;
      }
      return 0;
}