#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
template <class T>
using vec = vector<T>;
template <class T>
using vvec = vector<vec<T>>;
constexpr long long INF = 1LL << 60;
constexpr int INF_INT = 1 << 25;
constexpr long long MOD = (ll)1e9 + 7;
using ld = long double;
static const ld pi = 3.141592653589793L;
template <class T>
inline bool chmin(T &a, T b) {
  if (a > b) {
    a = b;
    return true;
  }
  return false;
}
template <class T>
inline bool chmax(T &a, T b) {
  if (a < b) {
    a = b;
    return true;
  }
  return false;
}
struct Edge {
  ll to, rev;
  long double cap;
  Edge(ll _to, long double _cap, ll _rev) {
    to = _to;
    cap = _cap;
    rev = _rev;
  }
};
using Edges = vector<Edge>;
using Graph = vector<Edges>;
void add_edge(Graph &G, ll from, ll to, long double cap, bool revFlag,
              long double revCap) {
  G[from].push_back(Edge(to, cap, (ll)G[to].size()));
  if (revFlag) G[to].push_back(Edge(from, revCap, (ll)G[from].size() - 1));
}
void solve() {
  ll n, m;
  cin >> n >> m;
  vec<ll> sw(n, 0);
  for (int(i) = (int)(0); i < (int)(m); ++i) {
    ll k;
    cin >> k;
    for (int(j) = (int)(0); j < (int)(k); ++j) {
      ll s;
      cin >> s;
      s--;
      sw[s] += (1LL << i);
    }
  }
  vec<ll> p(m);
  for (int(i) = (int)(0); i < (int)(m); ++i) {
    cin >> p[i];
  }
  ll ans = 0;
  ll all = 1LL << n;
  for (int(bit) = (int)(0); bit < (int)(all); ++bit) {
    ll state = 0;
    for (int(i) = (int)(0); i < (int)(n); ++i) {
      if ((bit >> i) & 1) {
        state ^= sw[i];
      }
    }
    ll con = 0;
    for (int(i) = (int)(0); i < (int)(m); ++i) {
      if ((bit >> i) & 1) {
        if (p[i]) con++;
      } else {
        if (!p[i]) con++;
      }
    }
    if (con == m) ans++;
  }
  cout << ans << '\n';
}
int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  solve();
  return 0;
}
