#include <cstdio>
#include <cstring>
#include <algorithm>
#include <vector>
const int N = 400005, V = 400003;
int n, q, c[N];
std::vector<int> E[N];
struct BiT
{
	int t[N];
	inline void update(int x, int v)
	{
		for(;x <= V;x += x & -x)
			t[x] += v;
		return;
	}
	inline int kth(int k)
	{
		int res = 0;
		for(int i = 18;i >= 0;--i)
			if((res | (1 << i)) <= V && k > (1 << i) - t[res | (1 << i)])
				k -= (1 << i) - t[res |= 1 << i];
		return res + 1;
	}
} T;
int f[N][4];
int main(void)
{
	scanf("%d", &n);
	for(int i = 1;i <= n;++i)
		scanf("%d", c + i);
	for(int i = 1, k;i <= n;++i)
	{
		scanf("%d", &k);
		E[i].resize(k);
		for(int j = 0;j < k;++j)
			scanf("%d", &E[i][j]);
		std::reverse(E[i].begin(), E[i].end());
	}
	for(int x = n;x >= 1;--x)
		for(int o = 0;o < 4;++o)
			if(E[x].empty() || c[x])
			{
				std::vector<int> tmp;
				int now = o;
				for(int y : E[x])
				{
					int v = f[y][now];
					if(v <= 1)
						now |= 1 << v;
					else
					{
						v = T.kth(v);
						T.update(v, 1);
						tmp.push_back(v);
					}
				}
				if(now == 3)
					f[x][o] = T.kth(2);
				else
					f[x][o] = now & 1 ? 1 : 0;
				for(int t : tmp)
					T.update(t, -1);
			}
			else
			{
				int now = o;
				for(int y : E[x])
					now = f[y][now] == 0;
				f[x][o] = now & 1;
			}
	int ans = 0;
	scanf("%d", &q);
	for(int i = 1, r;i <= q;++i)
		scanf("%d", &r), ans ^= f[r][1];
	puts(ans ? "Alice" : "Bob");
	return 0;
}