(D1) DFS Checker (Easy Version)

#include<bits/stdc++.h>
#define ll long long
using namespace std;
const int N = 1e5+10;

int n,q;
int a[N],p[N];
int id[N],siz[N];

void solve(){
	cin>>n>>q;
	siz[1]=n;
	for(int i=2;i<=n;i++){
		cin>>a[i];
		siz[i]=siz[i/2]/2;
	}
	for(int i=1;i<=n;i++){
		cin>>p[i];
		id[p[i]]=i;
	}
	while(q--){
		int x,y;
		cin>>x>>y;
		swap(p[x],p[y]);
		id[p[x]]=x;
		id[p[y]]=y;
		int flag=1;
		for(int i=2;i<=n;i++){
			int fa=i/2;
			if(id[i]<id[fa]||id[i]>=id[fa]+siz[fa]){
				cout<<"NO\n";
				flag=0;
				break;
			}
		}
		if(flag){
			cout<<"YES\n";
		}
	}
}

int main() {
    ios::sync_with_stdio(0);cin.tie(0);
    int t=1;
    cin >> t;
    while(t--) {
        solve();
    }
}