#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vi = vector<long long>;
using vl = vector<ll>;
using vb = vector<bool>;
template <typename T>
using Graph = vector<vector<T>>;
template <typename T>
using Spacial = vector<vector<vector<T>>>;
using pii = pair<long long, long long>;
using pll = pair<ll, ll>;
const long long MOD = 1e9 + 7;
const long long MOD2 = 998244353;
const double EPS = 1e-9;
const long long dx[4] = {1, 0, -1, 0};
const long long dy[4] = {0, 1, 0, -1};
template <typename T>
struct is_pair : false_type {};
template <typename T1, typename T2>
struct is_pair<pair<T1, T2>> : true_type {};
template <typename T>
struct is_vector : false_type {};
template <typename T>
struct is_vector<vector<T>> : true_type {};
template <typename T1, typename T2>
istream &operator>>(istream &istr, pair<T1, T2> &p) {
  istr >> p.first >> p.second;
  return istr;
}
template <typename T1, typename T2>
ostream &operator<<(ostream &ostr, const pair<T1, T2> &p) {
  ostr << p.first << " " << p.second;
  return ostr;
}
template <typename T>
istream &operator>>(istream &istr, vector<T> &vec) {
  for (auto itr = vec.begin(); itr != vec.end(); ++itr) {
    istr >> *itr;
  }
  return istr;
}
template <typename T>
ostream &operator<<(ostream &ostr, const vector<T> &vec) {
  if (vec.empty()) return ostr;
  bool vp = is_vector<T>() || is_pair<T>();
  ostr << vec.front();
  for (auto itr = ++vec.begin(); itr != vec.end(); ++itr) {
    ostr << (vp ? "\n" : " ") << *itr;
  }
  return ostr;
}
template <typename T1, typename T2>
inline bool chmax(T1 &a, T2 b) {
  return a < b && (a = b, true);
}
template <typename T1, typename T2>
inline bool chmin(T1 &a, T2 b) {
  return a > b && (a = b, true);
}
long long modpow(long long a, long long n, long long mod = MOD) {
  long long ret = 1;
  do {
    if (n & 1) ret = 1LL * ret * a % mod;
    a = 1LL * a * a % mod;
  } while (n >>= 1);
  return ret;
}
template <typename T>
T GCD(T a, T b) {
  return b ? GCD(b, a % b) : a;
}
template <typename T>
T LCM(T a, T b) {
  return a / GCD(a, b) * b;
}
template <typename T1, typename T2>
bool CompareBySecond(pair<T1, T2> a, pair<T1, T2> b) {
  return a.second != b.second ? a.second < b.second : a.first < b.first;
}
template <typename T>
bool CompareBySlope(pair<T, T> a, pair<T, T> b) {
  if (a.first * b.first < 0) return a.first < b.first;
  if (a.first == 0) return a.second >= 0 || b.first > 0;
  if (b.first == 0) return b.second < 0 && a.first < 0;
  return a.second * b.first < a.first * b.second;
}
void solve() {
  long long n, m;
  cin >> n >> m;
  Graph<bool> g(m, vb(n, false));
  for (long long i = 0; i < (long long)(m); ++i) {
    long long k;
    cin >> k;
    for (long long j = 0; j < (long long)(k); ++j) {
      long long s;
      cin >> s;
      --s;
      g[i][s] = true;
    }
  }
  vi rem(m);
  cin >> rem;
  long long ans = 0;
  for (long long tmp = 0; tmp < (long long)((1 << n)); ++tmp) {
    bitset<10> s(tmp);
    bool possible = true;
    for (long long i = 0; i < (long long)(m); ++i) {
      bool off = rem[i];
      off ^= (s.count() & 1);
      if (off) {
        possible = false;
        break;
      }
    }
    ans += possible;
  }
  cout << ans << endl;
}
signed main() {
  cin.tie(nullptr);
  ios::sync_with_stdio(false);
  cout << fixed << setprecision(12);
  solve();
  return 0;
}
