#include<bits/stdc++.h>
#define FILE "read"
#define MAXN 20100
#define cmin(a,b) a=min(a,b)
#define cmax(a,b) a=max(a,b)
using namespace std;
struct node{int y,next;}e[MAXN<<1];
int n,m,top,len,bcnt,dfs_clock,Link[MAXN],vis[MAXN],st[MAXN],dfn[MAXN],low[MAXN],belong[MAXN];
inline int read(){
int x=0,f=1; char ch=getchar();
while(!isdigit(ch)) {if(ch=='-') f=-1; ch=getchar();}
while(isdigit(ch)) {x=x*10+ch-'0'; ch=getchar();}
return x*f;
}
void insert(int x,int y){e[++len].next=Link[x];Link[x]=len;e[len].y=y;}
int get(){
int x; char ch=getchar();
while(ch!='m'&&ch!='h') ch=getchar();
if(ch=='m') x=read()*2;
else x=read()*2-1;
return x;
}
void tarjan(int x){
dfn[x]=low[x]=++dfs_clock; st[++top]=x; vis[x]=1;
for(int i=Link[x];i;i=e[i].next){
if(!dfn[e[i].y]){
tarjan(e[i].y);
cmin(low[x],low[e[i].y]);
}
else if(vis[e[i].y]) cmin(low[x],dfn[e[i].y]);
}
if(dfn[x]==low[x]){
bcnt++; int y;
do{
y=st[top--];
belong[y]=bcnt;
vis[y]=0;
}while(x!=y);
}
}
void pre(){
top=bcnt=len=dfs_clock=0;
memset(Link,0,sizeof(Link));
memset(dfn,0,sizeof(dfn));
}
void solve(){
top=dfs_clock=len=bcnt=0;
n=read(); m=read();
for(int i=1;i<=2*n;i++) Link[i]=dfn[i]=0;
for(int i=1;i<=m;++i){
int x=get(),y=get(),xp,yp;
int px=(x&1?x+1:x-1),py=(y&1?y+1:y-1);
insert(x,py); insert(y,px);
}
for(int i=1;i<=n*2;++i) if(!dfn[i]) tarjan(i);
for(int i=1;i<=n*2;i+=2) if(belong[i]==belong[i+1]) {puts("BAD"); return;}
puts("GOOD");
}
int main(){
freopen(FILE".in","r",stdin);
freopen(FILE".out","w",stdout);
for(int T=read();T;--T) solve();
return 0;
}