#include<cstdio>

#include<queue>

#include<cctype>

#include<cstring>

#include<cmath>

#include<stack>

#include<iostream>

#include<algorithm>

using namespace std;

typedef long long ll;

const int N=;

const int M=;

struct node{

    int to,nxt;

}e[M];

int T,n,m,head[N],cnt;

int dfn[N],low[N],t,l;

int to[N];

bool inq[N];

stack<int>q;

inline int neg(int x){

    if(x>n)return x-n;

    return x+n;

}

inline void add(int u,int v){

    e[++cnt].to=v;e[cnt].nxt=head[u];head[u]=cnt;

}

void tarjan(int u){

    dfn[u]=low[u]=++t;

    q.push(u);inq[u]=;

    for(int i=head[u];i;i=e[i].nxt){

        int v=e[i].to;

        if(!dfn[v]){

            tarjan(v);

            low[u]=min(low[u],low[v]);

        }else if(inq[v]){

            low[u]=min(low[u],dfn[v]);

        }

    }

    if(dfn[u]==low[u]){

        int v;l++;

        do{

            v=q.top();q.pop();

            inq[v]=;to[v]=l;

        }while(u!=v);

    }

}

inline void init(){

    cnt=t=l=;

    memset(head,,sizeof(head));

    memset(dfn,,sizeof(dfn));

}

inline int get(){

    int k;char ch=;

    while(ch!='m'&&ch!='h')ch=getchar();

    scanf("%d",&k);

    if(ch=='h')k+=n;

    return k;

}

int main(){

    scanf("%d",&T);

    while(T--){

        init();

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

        for(int i=;i<=m;i++){

            int a=get(),b=get();

            add(neg(a),b);

            add(neg(b),a);

        }

        for(int i=;i<=*n;i++)

            if(!dfn[i])tarjan(i);

        bool flag=;

        for(int i=;i<=n&&flag;i++){

            if(to[i]==to[i+n])flag=;

        }

        if(flag)puts("GOOD");

        else puts("BAD");

    }

}