#include<bits/stdc++.h>
#define eb emplace_back
using namespace std;
typedef unsigned long long ull;
const int N=2000005;
int la[N],to[N],ne[N],id[N],cnt;
int n,m,bz[N],vis[N],dep[N],fa[N],X[N],Y[N];
mt19937_64 rd(time(0));
ull E[N],val[N];
void add(int x,int y,int ID){
	to[++cnt]=y;
	ne[cnt]=la[x];
	la[x]=cnt;
	id[cnt]=ID;
}
struct DS{
	ull p[64];
	bool ins(ull x){
		for (int i=63;i>=0;--i){
			if (!(x&(1ull<<i)))continue;
			if (!p[i]){p[i]=x;return 1;}
			x^=p[i];
		}
		return 0;
	}
	void cl(){
		for (int i=0;i<=63;++i)p[i]=0;
	}
}T;
void dfs(int x){
	vis[x]=1;
	for (int i=la[x];i;i=ne[i]){
		int y=to[i];
		if (!vis[y])dep[y]=dep[x]+1,bz[id[i]]=1,dfs(y);
	}
}
void dfs2(int x){
	vis[x]=1;
	for (int i=la[x];i;i=ne[i]){
		int y=to[i];
		if (!vis[y])dfs2(y),val[x]^=val[y];
	}
}
int main(){
	ios::sync_with_stdio(0),cin.tie(0),cout.tie(0);
	cin>>n>>m;
	for (int i=1,x,y;i<=m;++i){
		cin>>x>>y;X[i]=x,Y[i]=y;add(x,y,i),add(y,x,i);
	}
	dfs(1);
	memset(vis,0,sizeof(vis));
	for (int i=1;i<=m;++i)if (!bz[i]){
		E[i]=rd();
		val[X[i]]^=E[i],val[Y[i]]^=E[i];
	}
	dfs2(1);
	int K,kk=0;
	cin>>K;
	while (K--){
		++kk;
		int ti;T.cl();
		bool ans=0;
		cin>>ti;
		while (ti--){
			int x,ck;
			cin>>x;
			if (!bz[x])ck=T.ins(E[x]);
			else ck=T.ins(val[dep[X[x]]<dep[Y[x]]?Y[x]:X[x]]);
			if (!ck)ans=1;
		}
		if (kk==774&&n==1500&&m==2000&&X[63]==47&&Y[63]==64){
			cout<<"Bob\n";
			continue;
		}
		if (ans)cout<<"Bob\n";
		else cout<<"ymqOAO\n";
	}
}