void main() {
	auto ip = readAs!(ulong[]), N = ip[0], M = ip[1];
	ulong[] k;
	ulong[][] m;
	foreach(i; 0..M) {
		auto ip2 = readAs!(ulong[]), k_ = ip2[0];
		k ~= k_;
		m ~= ip2[1..$].map!(i => i - 1).array;
	}
	auto p = readAs!(ulong[]);

	ulong d = 0, res = 0;
	while(d < (1 << N)) {
		auto bits = format(format("%%.%db", N), d).map!(i => i == '1').array;
		bool flag = true;
		foreach(i; 0..M) {
			ulong tmp;
			foreach(n; 0..k[i]) {
				if(bits[m[i][n]]) tmp++;
			}
			if(tmp % 2 == p[i]) flag = false;
		}
		if(flag) res++;
		d++;
	}
	res.writeln;
}

// =======================111=1===========

import std.stdio;
import std.string;
import std.functional;
import std.algorithm;
import std.range;
import std.traits;
import std.math;
import std.container;
import std.bigint;
import std.numeric;
import std.conv;
import std.typecons;
import std.ascii : toLower;
import std.bitmanip;
import core.bitop;

T readAs(T)() if (isBasicType!T) {
	return readln.chomp.to!T;
}

T readAs(T)() if (isArray!T) {
	return readln.split.to!T;
}

T[][] readMatrix(T)(uint height, uint width) if (!isSomeChar!T) {
	auto res = new T[][](height, width);
	foreach(i; 0..height) {
		res[i] = readAs!(T[]);
	}
	return res;
}

T[][] readMatrix(T)(uint height, uint width) if (isSomeChar!T) {
	auto res = new T[][](height, width);
	foreach(i; 0..height) {
		auto s = rs;
		foreach(j; 0..width) res[i][j] = s[j].to!T;
	}
	return res;
}

int ri() {
	return readAs!int;
}

double rd() {
	return readAs!double;
}

string rs() {
	return readln.chomp;
}
