#include<bits/stdc++.h>
using namespace std;
constexpr int M=2e5+5;bool vis[M];
int n,m,k,a[M],b[M],c[M],p[M],tr[M];
int read(){
	int x=0;char ch=getchar();
	while (!isdigit(ch)) ch=getchar();
	while (isdigit(ch)) x=x*10+ch-48,ch=getchar();
	return x;
}
bool check(){
	if (n-m>k) return 1;
	for (int i=2;i<=m;i++)
		if (p[b[i-1]]>p[b[i]])
			return 1;
	return 0;
}
void update(int x){while (x<=n) tr[x]++,x+=x&-x;}
int query(int x){int ans=0;while (x) ans+=tr[x],x-=x&-x;return ans;}
void solve(){
	n=read();m=read();k=read();
	for (int i=1;i<=n;i++) vis[i]=0;
	for (int i=1;i<=n;i++) p[a[i]=read()]=i;
	for (int i=1;i<=m;i++) vis[b[i]=read()]=1;
	for (int i=1;i<=k;i++) c[i]=read();
	if (check()) return puts("NO"),void();
	sort(c+1,c+k+1);
	for (int i=1;i<=n;i++) tr[i]=0;
	set<int>s;s.insert(0);s.insert(n+1);
	for (int i=n,pos=n-m;i;i--){
		if (vis[i]) {s.insert(p[i]);continue;}
		auto it=s.lower_bound(p[i]);
		int l=(*prev(it))+1,r=(*it)-1;
		int tmp=r-l+1-(query(r)-query(l-1));
		if (tmp<c[pos--]) return puts("NO"),void();
		update(p[i]); 
	}
	puts("YES");
}
int main(){int T=read();while (T--) solve();return 0;}