#include<iostream>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
#include<ctime>
#include<algorithm>
#include<iomanip>
#include<queue>
#include<set>
#include<map>
#include<vector>
using namespace std;
#define LL long long
#define FILE "dealing"
#define up(i,j,n) for(int i=j;i<=n;i++)
int read(){int x=0,f=1,ch=getchar();while(ch<'0'||ch>'9'){if(ch=='-')f=-1;ch=getchar();}while(ch>='0'&&ch<='9')x=(x<<1)+(x<<3)+ch-'0',ch=getchar();return x*f;
}
const int maxn=1600000,inf=1000000000;
bool cmin(int& a,int b){return a>b?a=b,true:false;}
bool cmax(int& a,int b){return a<b?a=b,true:false;}
int n,cnt[maxn];
struct node{int y,next;}e[maxn];int len=0,linkk[maxn];
void insert(int x,int y){e[++len].y=y;e[len].next=linkk[x];linkk[x]=len;}
int b[maxn][2],a[maxn],d[maxn];
bool c[maxn];bool flag=0;int q[maxn],top=0;
void dfs(int x){if(((x%2)&&c[x+1])||(!(x%2)&&c[x-1])){flag=1;return;}c[x]=1;q[++top]=x;for(int i=linkk[x];i;i=e[i].next){if(!c[e[i].y])dfs(e[i].y);}
}
int m;
int solve(){for(int i=1;i<=m<<1;i+=2){if(!c[i]&&!c[i+1]){top=0;dfs(i);if(flag){while(top)c[q[top--]]=0;flag=0;dfs(i+1);if(flag)return 1;}}}return 0;
}
int main(){//freopen(FILE".in","r",stdin);
//  freopen(FILE".out","w",stdout);n=read();m=read();up(i,1,n)a[i]=read();up(i,1,m){cnt[i]=read();up(j,1,cnt[i]){int y=read();if(!b[y][0])b[y][0]=i;else b[y][1]=i;}}up(i,1,n){if(a[i])insert(b[i][0]<<1,b[i][1]<<1),insert(b[i][1]<<1,b[i][0]<<1),insert((b[i][0]<<1)-1,(b[i][1]<<1)-1),insert((b[i][1]<<1)-1,(b[i][0]<<1)-1);else insert((b[i][0]<<1)-1,(b[i][1]<<1)),insert((b[i][1]<<1)-1,(b[i][0]<<1)),insert((b[i][0]<<1),(b[i][1]<<1)-1),insert(b[i][1]<<1,(b[i][0]<<1)-1);}if(solve())printf("NO\n");else printf("YES\n");return 0;
}