//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2")
//#pragma GCC optimize("Ofast","unroll-loops","inline")
#include<bits/stdc++.h>
#define ll long long
//#define int ll
#define pb push_back
#define pii pair<int,int>
#define MP make_pair
#define fi first
#define se second
using namespace std;
const int N=5e5+10,M=1e6+10,mod=998244353;
int n,p[N],a[N],ct[N];
vector<int> e[N];
void dfs(int u){
	if(!e[u].size()) return ct[u]=a[u]==1?1:-1,void();
	a[u]=0;
	for(int v:e[u]) dfs(v),a[u]|=a[v],ct[u]+=ct[v];
	if(ct[u]<0) ct[u]--;
	else if(ct[u]>0) ct[u]++;
	else if(n&1) ct[u]++;
	else ct[u]--;
}
void solve(){
	cin>>n;
	for(int i=1;i<=n;i++) ct[i]=0,e[i].clear();
	for(int i=2;i<=n;i++) cin>>p[i],e[p[i]].pb(i);
	for(int i=1;i<=n;i++) cin>>a[i],a[i]^=1,a[i]++;
	dfs(1);
//	for(int i=1;i<=n;i++) cout<<ct[i]<<' '<<a[i]<<'\n';
	if(ct[1]<0) return cout<<"yes\n",void();
	else return cout<<"no\n",void(); 
}
signed main(){
//	freopen("alphago.in","r",stdin);
//	freopen("alphago.out","w",stdout);
	ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
	int c,T;cin>>c>>T;
	while(T--) solve();
	return 0;
}