#include <iostream>
#include <string.h>
#include <stdio.h>
#include <vector>
#include <stack>
#include <queue>
#include <algorithm>
#include <math.h>
#include <cstdio>
using namespace std;

int s[200005],t,n,m,i;

int findf(int x)
{
    return x==s[x]?x:s[x]=findf(s[x]);
}

void hebing (int x,int y)
{
    int fx=findf(x);
    int fy=findf(y);
    if(fx!=fy)
    {
        s[fx]=fy;
    }
}

int pd(int x,int y)
{
    if(findf(x)==findf(y))
    {
        return 1; 
    }
    else
    {
        return 0;
    }
}

int main()
{
    ios::sync_with_stdio(false);
    scanf("%d",&t);
    while(t--)
    {
        scanf("%d %d",&n,&m); 
        for(i=1;i<=2*n;i++)
        {
            s[i]=i;
         } 
        while(m--)
        {
            int a,b;
            char S[5];
            scanf("%s%d%d",S,&a,&b);
            if(S[0]==‘D‘)
            {
                hebing(a+n,b);
                hebing(a,b+n);
            }
            else
            {
                if(pd(a,b)==1)
                {
                    cout << "In the same gang." << endl;
                }
                else if(pd(a,b+n)==1)
                {
                    cout << "In different gangs." << endl;
                }
                else
                {
                    cout << "Not sure yet." << endl;
                }
            }
        }
    }
}