#include <iostream>
#include <iomanip>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <vector>
#include <map>
using namespace std;
const int Mxdt = 100000;
char gc() {
    static char buf[Mxdt], *p1 = buf, *p2 = buf;
    return p1 == p2 && (p2 = (p1 = buf) + fread(buf, 1, Mxdt, stdin), p1 == p2) ? EOF : *p1++;
}
int read() {
    int a = 0;
    bool opt = 0;
    char c = gc();

    while (c < '0' || c > '9')
        opt |= c == '-', c = gc();

    while (c >= '0' && c <= '9')
        a = (a << 3) + (a << 1) + (c ^ 48), c = gc();

    return opt ? -a : a;
}
int n, c[200005], m, k, f[200005][4], ans;
vector<int>son[200005];
int a[200005], N;
void add(int x, int v) {
    for (; x <= N; x += x & -x)
        a[x] += v;
}
int ask(int x) {
    int now = 0, sum = 0;

    for (int i = 10; ~i; --i) {
        if (now + (1 << i) <= N && sum + a[now + (1 << i)] < x) {
            now += (1 << i);
            sum += a[now];
        }
    }

    return now + 1;
}
int vis[200005], q[200005], tot;
void ADD(int x) {
    ++x;

    if (!vis[x]) {
        add(x, -1);
        q[++tot] = x;
        vis[x] = 1;
    }
}
void DEL() {
    while (tot) {
        vis[q[tot]] = 0;
        add(q[tot], 1);
        --tot;
    }
}
int main() {
    n = read();

    for (int i = 1; i <= n; ++i)
        c[i] = read();

    for (int i = 1; i <= n; ++i) {
        m = read();

        for (int j = 1; j <= m; ++j) {
            son[i].push_back(read());
        }

        reverse(son[i].begin(), son[i].end());
    }

    N = sqrt(2 * n);

    for (int i = 1; i <= N; ++i)
        add(i, 1);

    for (int i = n; i; --i) {
        for (int S = 0; S < 4; ++S) {
            if (c[i] == 0) {
                int now = S;

                for (int x : son[i]) {
                    now = f[x][now];

                    if (now < 2)
                        now = (1 << now);
                    else
                        now = 0;
                }

                if (now & 1)
                    f[i][S] = 1 + bool(now & 2);
                else
                    f[i][S] = 0;
            } else {
                int now = 0, P = S;

                for (int x : son[i]) {
                    now = ask(f[x][P] + 1) - 1;

                    if (now < 2)
                        P |= (1 << now);
                    else
                        ADD(now);
                }

                if (P & 1)
                    ADD(0);

                if (P & 2)
                    ADD(1);

                f[i][S] = ask(1) - 1;
                DEL();
            }
        }
    }

    k = read();

    for (int i = 1; i <= k; ++i)
        ans ^= f[read()][1];

    puts(ans ? "Alice" : "Bob");
    return 0;
}