// Problem: P10075 [GDKOI2024 普及组] 切割
// Contest: Luogu
// URL: https://www.luogu.com.cn/problem/P10075
// Memory Limit: 512 MB
// Time Limit: 2000 ms
// 
// Powered by CP Editor (https://cpeditor.org)

#include <bits/stdc++.h>
#define pb emplace_back
#define fst first
#define scd second
#define mkp make_pair
#define mems(a, x) memset((a), (x), sizeof(a))

using namespace std;
typedef long long ll;
typedef double db;
typedef unsigned long long ull;
typedef long double ldb;
typedef pair<int, int> pii;

const int maxn = 1000100;

int n, m, q, dep[maxn];
bool vis[maxn], mk[maxn];
ull a[maxn], b[maxn];
pii c[maxn];
vector<pii> G[maxn];
vector<int> T[maxn];
mt19937_64 rnd(chrono::steady_clock::now().time_since_epoch().count());

void dfs(int u, int fa) {
	vis[u] = 1;
	for (pii _ : G[u]) {
		int v = _.fst, d = _.scd;
		if (d == fa) {
			continue;
		}
		if (vis[v]) {
			if (dep[v] < dep[u]) {
				b[d] = rnd();
				a[v] ^= b[d];
				a[u] ^= b[d];
			}
			continue;
		}
		mk[d] = 1;
		dep[v] = dep[u] + 1;
		T[u].pb(v);
		T[v].pb(u);
		dfs(v, d);
	}
}

void dfs2(int u, int fa) {
	for (int v : T[u]) {
		if (v == fa) {
			continue;
		}
		dfs2(v, u);
		a[u] ^= a[v];
	}
}

struct Basis {
	ull p[64];
	bool fl;
	
	inline void init() {
		mems(p, 0);
		fl = 0;
	}
	
	inline void insert(ull x) {
		for (int i = 63; ~i; --i) {
			if ((x >> i) & 1) {
				if (!p[i]) {
					p[i] = x;
					return;
				}
				x ^= p[i];
			}
		}
		fl = 1;
	}
} B;

void solve() {
	scanf("%d%d", &n, &m);
	for (int i = 1, u, v; i <= m; ++i) {
		scanf("%d%d", &u, &v);
		G[u].pb(v, i);
		G[v].pb(u, i);
		c[i] = mkp(u, v);
	}
	dfs(1, -1);
	dfs2(1, -1);
	scanf("%d", &q);
	for (int i = 1; i <= m; ++i) {
		if (mk[i]) {
			int u = c[i].fst, v = c[i].scd;
			if (dep[u] < dep[v]) {
				swap(u, v);
			}
			b[i] = a[u];
		}
	}
	while (q--) {
		int k, x;
		B.init();
		scanf("%d", &k);
		while (k--) {
			scanf("%d", &x);
			B.insert(b[x]);
		}
		puts(B.fl ? "Bob" : "ymqOAO");
	}
}

int main() {
	int T = 1;
	// scanf("%d", &T);
	while (T--) {
		solve();
	}
	return 0;
}