#include<bits/stdc++.h>
using namespace std;

const int N=5e5+5;
int cid,n,p[N],c[N];

int tot,hd[N],to[N],nxt[N];
inline void Add(int u,int v){to[++tot]=v;nxt[tot]=hd[u];hd[u]=tot;}
int f[N];
void dfs(int u){
	if(!hd[u]){f[u]=!c[u]?1:-1;return;}
	f[u]=0;
	for(int i=hd[u];i;i=nxt[i]){int v=to[i];dfs(v);f[u]+=f[v];}
	if(f[u])f[u]>0?f[u]++:f[u]--;
	else n&1?f[u]--:f[u]++;
}
inline bool solve(){
	scanf("%d",&n);
	for(int i=2;i<=n;i++)scanf("%d",&p[i]);
	for(int i=1;i<=n;i++)scanf("%d",&c[i]);
	for(int i=1;i<=n;i++)hd[i]=0;tot=0;
	for(int i=2;i<=n;i++)Add(p[i],i);
	dfs(1);
	return f[1]>0;
}
int main(){
	freopen("alphago.in","r",stdin);
	freopen("alphago.out","w",stdout);
	int T;scanf("%d%d",&cid,&T);
	while(T--)puts(solve()?"yes":"no");
	return 0;
}