#include<bits/stdc++.h>
#define rep(i, n) for(int i = 0; i < n; ++i)
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef pair<int, int> pii;

int n, m;
int c[400400], st[400400];
int eu[400400], ev[400400];
int k; vi r;

int sg[4][400400];
namespace bit{
	int val[400400];
	void upd(int p, int v){
		p -= 1;
		//cout << "upd " << p << " " << v << endl;
		while(p <= m+1) val[p] += v, p += p & -p;
	}
	int lb(int v){
		v -= 1;
		//cout << "lb " << v << ": ";
		int p = 0;
		for(int i = 18; i >= 0; --i){
			if(p + (1<<i) > m+1) continue;
			if(val[p + (1<<i)] < v){
				p += (1<<i);
				v -= val[p];
			}
		}
		//cout << p+1 << endl;
		return (p+1) + 1;
	}
}
int tmp[400400];

int main(){
	//freopen("dfs.in", "r", stdin);
	//freopen("dfs.out", "w", stdout);
	ios::sync_with_stdio(false);

	cin >> n;
	rep(i, n)
		cin >> c[i];
	int cursp = 0;
	rep(i, n){
		int kk;
		cin >> kk;
		if(kk == 0) c[i] = 1;
		st[i] = cursp;
		for(int j = cursp; j < cursp + kk; ++j){
			eu[j] = i;
			cin >> ev[j];
			--ev[j];
		}
		cursp += kk;
	}
	st[n] = cursp;

	cin >> k;
	r.resize(k);
	rep(i, k)
		cin >> r[i], --r[i];
	
	m = st[n];
	
	for(int i = 2; i <= m; ++i)
		bit::upd(i, 1);
	for(int i = n-1; i >= 0; --i) rep(tp, 4){
		bool has0 = (tp & 1), has1 = (tp & 2);
		if(c[i] == 1){
			for(int j = st[i+1] - 1; j >= st[i]; --j){
				int t = ev[j];
				tmp[j] = sg[has0 + 2*has1][t];
				if(tmp[j] == 0) has0 = 1;
				else if(tmp[j] == 1) has1 = 1;
				else tmp[j] = bit::lb(tmp[j]), bit::upd(tmp[j], -1);
			}
			if(!has0) sg[tp][i] = 0;
			else if(!has1) sg[tp][i] = 1;
			else sg[tp][i] = bit::lb(2);
			for(int j = st[i]; j < st[i+1]; ++j) if(tmp[j] >= 2)
				bit::upd(tmp[j], 1);
		} else {
			int cur = !(has0);
			for(int j = st[i+1] - 1; j >= st[i]; --j){
				int t = ev[j];
				//cout << i << " " << cur << " " << t << endl;
				cur = (bool)(sg[cur ? 0 : 1][t]);
			}
			sg[tp][i] = !(cur);
		}
	}
	//rep(i, n){
	//	cout << i << ": " << sg[0][i] << " " << sg[1][i] << " " << sg[2][i] << " " << sg[3][i] << "\n";
	//}
	int ans = 0;
	rep(i, k)
		ans ^= sg[1][r[i]];
	cout << (ans ? "Alice" : "Bob") << "\n";

	return 0;
}