#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ull unsigned long long
#define pb push_back

mt19937_64 rd(chrono::steady_clock::now().time_since_epoch().count());

const int N=1e6+5;
int n,m,q;
ull d[N],val[N],h[70];
bool vis[N];
struct Nod{
  int v,w;
};
vector<Nod> G[N];

void dfs(int u,int fa){
  vis[u]=true;
  for(auto i:G[u]){
	int v=i.v,w=i.w;
	if(!vis[v]) dfs(v,u),d[u]^=d[v],val[w]=d[v];
	else if(v!=fa&&!val[w]) val[w]=rd(),d[u]^=val[w],d[v]^=val[w]; 
  }
}

bool ins(ull x){
  for(int i=64;i>=0;i--){
    if((x>>i)&1){
	  if(!h[i]){
	    h[i]=x;
		return true;
	  }
	  x^=h[i];
	}
  }
  return false;
}

int main(){
  #ifdef H_W_Y
  freopen("graph.in","r",stdin);
  freopen("graph.out","w",stdout);
  #endif

  ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
  cin>>n>>m;
  for(int i=1,u,v;i<=m;i++) cin>>u>>v,G[u].pb({v,i}),G[v].pb({u,i});
  dfs(1,1);
  cin>>q;
  while(q--){
	int k,x,fl=1;cin>>k;
	memset(h,0,sizeof(h));
	while(k--) cin>>x,fl&=ins(val[x]);
    if(fl) cout<<"ymqOAO\n";
	else cout<<"Bob\n";
  }
  return 0;
}