#include<stdio.h>

#include<iostream>

#include<algorithm>

#include<string>

#include<string.h>

#include<math.h>

#include<limits.h>

#include<time.h>

#include<stdlib.h>

#include<map>

#include<queue>

#include<set>

#include<stack>

#include<vector>

#define LL long long

using namespace std;

int father[100005], delta[100005];

void init()

{

    memset(delta, 0, sizeof delta);

    for(int i = 0; i < 100005; i++)

        father[i] = i;

}

int Find(int a)

{

    if(father[a] != a)

    {

        int tmp = Find(father[a]);

        delta[a] = (delta[a] + delta[father[a]]) % 2;

        father[a] = tmp;

    }

    return father[a];

}

int main()

{

    int T;

    scanf("%d", &T);

    while(T--)

    {

        init();

        int n, m;

        scanf("%d%d", &n, &m);

        while(m--)

        {

            char o[2];

            int x, y;

            scanf("%s%d%d", o, &x, &y);

            int c = Find(x), d = Find(y);

            if(o[0] == 'A')

            {

                if(c != d) puts("Not sure yet.");

                else

                {

                    if(delta[x] == delta[y]) puts("In the same gang.");

                    else puts("In different gangs.");

                }

            }

            else

            {

                if(c == d) continue;

                father[c] = d;

                delta[c] = (delta[y] - delta[x] + 1) % 2;

            }

        }

    }

    return 0;

}