#include <bits/stdc++.h>
using namespace std;
// define
#define int long long
#define UNIQUE(v) v.erase(unique(all(v)), v.end());
#define ZIP(v) sort(all(v)),UNIQUE(v)
#define ADD(a, b) a = (a + b) % mod
#define SUB(a, b) a = (a+mod-b)%mod
#define MUL(a, b) a = (((a)%mod) * ((b)%mod)) % mod
#define rollcall cout << "I'm Sucu." << endl;
#define repi(i,m,n) for(int i = m;i < n;i++)
#define drep(i,n,m) for(int i = n;i >= m;i--)
#define rep(i,n) repi(i,0,n)
#define rrep(i,n) repi(i,1,n+1)
#define chmin(x,y) x = min(x,y)
#define chmax(x,y) x = max(x,y)
#define all(v) v.begin(),v.end()
#define rall(v) v.rbegin(), v.rend()
#define dmp(x,y) make_pair(x,y)
#define dmt(x, y, z) make_tuple(x, y, z)
#define pb(x) push_back(x)
#define pf(x) push_front(x)
#define fi first
#define se second
// debug
template <typename T, typename U>
ostream &operator<<(ostream &os, const pair<T, U> &p){
  os << "(" << p.first << "," << p.second << ")";return os;
}
template <typename T, typename U, typename V>
ostream &operator<<(ostream &os, const tuple<T, U, V> &t){
  os << "(" << get<0>(t) << "," << get<1>(t) << "," << get<2>(t) << ")";
  return os;
}
template <typename T>
ostream &operator<<(ostream &os, const vector<T> &v){
  for (auto it = v.begin();it != v.end();++it){
    if(it != v.begin())os << " ";os << *it;
  }return os;
}
template <typename T, typename U>
ostream &operator<<(ostream &os, const map<T, U> &mp){
  for(auto x: mp)os << "(" << x.first << "," << x.second << ")" << endl;
  return os;
}
template<typename T, int SIZE>
int array_length(const T (&)[SIZE]){return SIZE;}
template<typename T, int N>
void PRINTF(const T (&a)[N], int s = N, int t = -1, bool f = true){
	if(t == -1){rep(i,s){if(i)cout << " ";cout << a[i];}}
	else repi(i,s,t){if(i!=s)cout << " ";cout << a[i];}
	if(f)cout << "\n";
}
template<typename T, int N1, int N2>
void PRINTF(const T (&a)[N1][N2], int h = N1, int w = N2){
	rep(i,h){rep(j,w){cout << a[i][j] << " \n"[j==w-1];}}
}
string substr(const string &str, int S1, int S2 = -1){
  if(S2 == -1)return str.substr(S1);
  return str.substr(S1, S2-S1);
}
// typedef
typedef complex<double> Point;
typedef pair<int, int> P;
typedef pair<int, P> PP;
typedef pair<P, int> Pi;
typedef tuple<int, int, int> TT;
typedef pair<int, TT> PT;
typedef vector<int> vi;
typedef deque<int> dq;
const int inf = 1e9+7;
const int INF = 1e18+7;
// int sum = accumulate(a, a+n, 0LL);
// int mx = max_element(a, a+n);
// int mn = min_element(a, a+n);
// int cnt = count(a, a+n, k);

int n, m;
int state[20];  // スイッチがONなら1、OFFなら0
int p[20];
vector<int> s[20];  // 電球の繋がってるスイッチを保存

// recの仕様
// k+1～n個目のスイッチのON、OFFが決まっておりk個目のスイッチを決めた時の組み合わせの数
int rec(int k){   // k個目のスイッチのON、OFFを決める
  if(k == 0){   // 仕様より1～n個目のスイッチまでのON、OFFが決まってるのでその状態が条件を満たすかどうかを判定する
    for(int i = 1;i <= m;i++){
      int cnt = 0;
      for(int j = 0;j < s[i].size();j++)cnt += state[s[i][j]];
      if(cnt%2 != p[i])return 0;
    }
    return 1;
  }
  int ans = 0;    // 組み合わせ保存用
  state[k] = 0;   // k個目のスイッチが0の場合
  ans += rec(k-1);
  state[k] = 1;   // k個目のスイッチが1の場合
  ans += rec(k-1);
  return ans;
}

signed main(){
  cin >> n >> m;
  for(int i = 1;i <= m;i++){
    int k;cin >> k;
    for(int j = 0;j < k;j++){
      int tmp;cin >> tmp;
      s[i].pb(tmp);
    }
  }
  for(int i = 1;i <= m;i++)cin >> p[i];
  
  int ans = rec(n);
  cout << ans << endl;
  return 0;
}






Measured memory_bytes: 256