#include<bits/stdc++.h>
#define FRU freopen("out.txt","w",stdout)
#define FRO freopen("in.txt","r",stdin)
#define pb push_back
#define mp make_pair
#define ff first
#define ss second
#define all(ara,n) memset(ara,n,sizeof ara)
#define loop(i,j,n) for(i=j;i<n;i++)
#define rloop(i,j,n) for(i=n;i>=j;i--)
#define INF 2147483647
#define LL long long
//const int row[]={-1, -1, -1,  0,  0,  1,  1,  1};  // Kings Move
//const int col[]={-1,  0,  1, -1,  1, -1,  0,  1};  // Kings Move
//const int row[]={-2, -2, -1, -1,  1,  1,  2,  2};  // Knights Move
//const int col[]={-1,  1, -2,  2, -2,  2, -1,  1};  // Knights Move
//const int row[]={-1,0,0,1,0};
//const int col[]={0,-1,1,0,0};
int gcd(int a,int b){return b==0?a:gcd(b,a%b);}
int lcm(int a,int b){return ((a*b)/gcd(a,b));}


using namespace std;
int par[10000007];

void make_set(int n)
{
    for(int i=0;i<=n;i++)par[i]=i;
}

int find(int n)
{
    if(par[n]==n)return n;
    par[n]=find(par[n]);
    return par[n];
}

void make_union(int a,int b)
{
    int n=par[a];
    int m=par[b];
    par[n]=m;
}

int check(int a,int b)
{
    if(find(a)==find(b))return 1;
    else return 2;
}

int main()
{
//FRO;
//FRU;
//std::ios_base::sync_with_stdio(false);
    int a,b,c,i,j,k=0,tc,t;
    int n,m,cnt=0;
    scanf("%d",&tc);
    for(t=1;t<=tc;t++)
    {
        char s[10001];
        hell:;
        if(k!=0)printf("\n");
        k++;//printf("?????????????? %d\n",n);
        scanf("%d\n",&n);
        int cnt1=0,cnt2=0;
        make_set(10000007);
        //for(i=1;i<=n;i++)printf("%d ",par[i]);printf("\n");
        //getchar();
        char ch;//printf("!!!!!!!!!!!!!! %d\n",n);
        while(1)
        {
            ch=getc(stdin);
            char s1[100001],s2[100001];
            s[0]=ch;
            if(ch!='c'&& ch!='q')
            {
                printf("%d,%d\n",cnt1,cnt2);
                break;
            }
            scanf("%d%d\n",&a,&b);
            if(s[0]=='c')
            {
                /*for(i=2,j=0;s[i]!=' ';i++)s1[j++]=s[i];
                for(i++,j=0;s[i]!='\0';i++)s2[j++]=s[i];
                j=1;
                for(i=strlen(s1)-1;i>=0;i--)
                {
                    a=a+(j*s1[i]-'0');
                }
                for(i=strlen(s2)-1,j=1;i>=0;i--)
                {
                    b=b+(j*s2[i]-'0');
                }*/
                if(find(a)!=find(b))make_union(a,b);
            }
            else if(s[0]=='q')
            {
                /*for(i=2,j=0;s[i]!=' ';i++)s1[j++]=s[i];
                for(i++,j=0;s[i]!='\0';i++)s2[j++]=s[i];
                j=1;
                for(i=strlen(s1)-1;i>=0;i--)
                {
                    a=a+(j*s1[i]-'0');
                }
                for(i=strlen(s2)-1,j=1;i>=0;i--)
                {
                    b=b+(j*s2[i]-'0');
                }*///printf("%d %d %d %d\n",a,b,find(a),find(b));
                //for(i=1;i<=n;i++)printf("%d ",par[i]);printf("\n");
                if(find(a)==find(b))cnt1++;
                else cnt2++;
            }
        }
    }
return 0;
}