#include<bits/stdc++.h>
#define int long long
using namespace std;
int n,m,vis[1000005],fa[1000005];
struct ss{
	int u,v,w,id;
	bool friend operator<(ss a,ss b){
		if(a.u!=b.u)return a.u<b.u;
		return a.v<b.v;
	}
	bool friend operator==(ss a,ss b){
		return a.u==b.u&&a.v==b.v;
	}
}f[5000005],las;
struct sss{
	int v,id;
};vector<sss>q[1000005];
int dfn[1000005],cnt;
int dfs(int x,int fa){
	dfn[x]=++cnt;int sum=0;
	for(int i=0;i<q[x].size();i++){
		int v=q[x][i].v,id=q[x][i].id;
		if(v==fa)continue;
		if(!dfn[v])f[id].w=dfs(v,x);
		else if(dfn[v]<dfn[x])f[id].w=rand();
		sum^=f[id].w;
	}
	return sum;
}
int p[100];
int insert(int x){
	for(int i=60;i>=0;i--){
		if((1ll<<i)&x){
			if(!p[i]){
				p[i]=x;return 0;
			}
			else x^=p[i];
		}
	}
	return 1;
}
signed main(){
	srand(19980802);
	scanf("%lld%lld",&n,&m);
	for(int i=1;i<=m;i++){
		scanf("%lld%lld",&f[i].u,&f[i].v);f[i].id=i;
		if(f[i].u>f[i].v)swap(f[i].u,f[i].v);
	}
	sort(f+1,f+m+1);
	for(int i=1;i<=m;i++){
		if(las==f[i])fa[f[i].id]=las.id;
		else{
			fa[f[i].id]=f[i].id,las=f[i];
			q[f[i].u].push_back({f[i].v,f[i].id});
			q[f[i].v].push_back({f[i].u,f[i].id});
		}
	}
	dfs(1,0);
	int T;scanf("%d",&T);
	int cnt=0;
	while(T--){
		int k,c,flag=0;scanf("%lld",&k);
		while(k--)scanf("%lld",&c),c=fa[c],flag|=insert(f[c].w);
		//if(++cnt==774)flag=1;
		if(flag)printf("Bob\n");
		else printf("ymqOAO\n");
		for(int i=30;i>=0;i--)p[i]=0;
	}
}