#include<iostream>
#include<cstdio>
#include<vector>
#define N 200000
using namespace std;
int read()
{
	char c=0;
	int sum=0;
	while (c<'0'||c>'9') c=getchar();
	while ('0'<=c&&c<='9') sum=sum*10+c-'0',c=getchar();
	return sum;
}
int n,rt,fa[N+1],p[N+1],a[N+1],tong[N+1],length;
vector<int>E[N+1];
void dfs(int x)
{
	tong[++length]=x;
	for (int i=0;i<E[x].size();++i) fa[E[x][i]]=x,dfs(E[x][i]);
	return;
}
int main()
{
	int d,x;
	bool op=1;
	n=read(),rt=read();
	for (int i=1;i<=n;++i) a[i]=read();
	for (int i=1;i<=n;++i)
	{
		d=read();
		while (d--) x=read(),E[i].push_back(x);
	}
	for (int i=1;i<=n;++i) p[i]=read();
	dfs(1);
	for (int i=length;i>=2;--i)
	{
		if (p[tong[i]]!=a[tong[i]]) swap(p[tong[i]],p[fa[tong[i]]]);
		op&=(p[tong[i]]==a[tong[i]]);
	}
	if (op)	puts("YES");
	else puts("NO");
	puts("no comment");
	puts("no comment");
	return 0;
}