#include <bits/stdc++.h>
using namespace std;
template <typename T, typename U>
inline void smin(T &a, U b) {
  if (a > b) a = b;
}
template <typename T, typename U>
inline void smax(T &a, U b) {
  if (a < b) a = b;
}
template <class T>
inline void gn(T &first) {
  char c, sg = 0;
  while (c = getchar(), (c > '9' || c < '0') && c != '-')
    ;
  for ((c == '-' ? sg = 1, c = getchar() : 0), first = 0; c >= '0' && c <= '9';
       c = getchar())
    first = (first << 1) + (first << 3) + c - '0';
  if (sg) first = -first;
}
template <class T, class T1>
inline void gn(T &first, T1 &second) {
  gn(first);
  gn(second);
}
template <class T, class T1, class T2>
inline void gn(T &first, T1 &second, T2 &z) {
  gn(first);
  gn(second);
  gn(z);
}
template <class T>
inline void print(T first) {
  if (first < 0) {
    putchar('-');
    return print(-first);
  }
  if (first < 10) {
    putchar('0' + first);
    return;
  }
  print(first / 10);
  putchar(first % 10 + '0');
}
template <class T>
inline void printsp(T first) {
  print(first);
  putchar(' ');
}
template <class T>
inline void println(T first) {
  print(first);
  putchar('\n');
}
template <class T, class U>
inline void print(T first, U second) {
  printsp(first);
  println(second);
}
template <class T, class U, class V>
inline void print(T first, U second, V z) {
  printsp(first);
  printsp(second);
  println(z);
}
int power(int a, int b, int m, int ans = 1) {
  for (; b; b >>= 1, a = 1LL * a * a % m)
    if (b & 1) ans = 1LL * ans * a % m;
  return ans;
}
int a[1010], indeg[1010], tindeg[1010], t[10][10];
vector<int> adj[1010];
queue<int> tq[4], q[4];
int main() {
  t[1][2] = 1;
  t[1][3] = 2;
  t[2][1] = 2;
  t[2][3] = 1;
  t[3][1] = 1;
  t[3][2] = 2;
  int n;
  gn(n);
  for (int i = 1; i <= n; i++) gn(a[i]);
  int st;
  for (int i = 1; i <= n; i++) {
    int k;
    gn(k);
    for (int j = 0; j < k; j++) {
      int u;
      gn(u);
      adj[u].push_back(i);
      tindeg[i]++;
    }
  }
  for (int i = 1; i <= n; i++) {
    if (tindeg[i] == 0) tq[a[i]].push(i);
  }
  int res = 0x3f3f3f3f;
  for (int j = 1; j <= 3; j++) {
    for (int p = 1; p <= n; p++) indeg[p] = tindeg[p];
    for (int p = 1; p <= n; p++) q[a[p]] = tq[a[p]];
    if (q[j].empty()) continue;
    int ans = 0, tmp = j;
    int pre = 0;
    while (true) {
      if (pre) {
        if (pre == 1) {
          if (!q[2].empty()) {
            ans += t[1][2];
            tmp = 2;
          } else if (!q[3].empty()) {
            ans += t[1][3];
            tmp = 3;
          } else
            break;
        } else if (pre == 2) {
          if (!q[3].empty()) {
            ans += t[2][3];
            tmp = 3;
          } else if (!q[1].empty()) {
            ans += t[2][1];
            tmp = 1;
          } else
            break;
        } else {
          if (!q[1].empty()) {
            ans += t[3][1];
            tmp = 1;
          } else if (!q[2].empty()) {
            ans += t[3][2];
            tmp = 2;
          } else
            break;
        }
      }
      pre = tmp;
      while (!q[tmp].empty()) {
        int u = q[tmp].front();
        q[tmp].pop();
        ans++;
        for (int i = 0; i < adj[u].size(); i++) {
          int v = adj[u][i];
          if (--indeg[v] == 0) {
            q[a[v]].push(v);
          }
        }
      }
    }
    smin(res, ans);
  }
  println(res);
  return 0;
}
