#include<bits/stdc++.h>
#include<sstream>
#include<cassert>
#define fi first
#define se second
#define i128 __int128
using namespace std;
typedef long long ll;
typedef double db;
typedef pair<int,int> PII;
const double eps=1e-7;
const int N=5e5+7 ,M=5e5+7, INF=0x3f3f3f3f,mod=1e9+7,mod1=998244353;
const long long int llINF=0x3f3f3f3f3f3f3f3f;
inline ll read() {ll x=0,f=1;char c=getchar();while(c<'0'||c>'9') {if(c=='-') f=-1;c=getchar();}
while(c>='0'&&c<='9') {x=(ll)x*10+c-'0';c=getchar();} return x*f;}
inline void write(ll x) {if(x < 0) {putchar('-'); x = -x;}if(x >= 10) write(x / 10);putchar(x % 10 + '0');}
inline void write(ll x,char ch) {write(x);putchar(ch);}
void stin() {freopen("in_put.txt","r",stdin);freopen("my_out_put.txt","w",stdout);}
bool cmp0(int a,int b) {return a>b;}
template<typename T> T gcd(T a,T b) {return b==0?a:gcd(b,a%b);}
template<typename T> T lcm(T a,T b) {return a*b/gcd(a,b);}
void hack() {printf("\n----------------------------------\n");}

int T,hackT;
int n,m,k;
int w[N];
bool b[N];
struct Node{
	int l,r;
	int idx;
};
Node tr[N*4];

void pushup(int u) {
	if(w[tr[u<<1].idx]>=w[tr[u<<1|1].idx]) tr[u].idx=tr[u<<1].idx;
	else tr[u].idx=tr[u<<1|1].idx;
}

void build(int u,int l,int r) {
	if(l==r) tr[u]={l,r,l};
	else {
		tr[u]={l,r};
		int mid=l+r>>1;
		build(u<<1,l,mid),build(u<<1|1,mid+1,r);
		
		pushup(u);
	}
}

int query(int u,int l,int r) {
	if(tr[u].l>=l&&tr[u].r<=r) return tr[u].idx;
	else {
		int mid=tr[u].l+tr[u].r>>1;
		
		if(l<=mid&&r>mid) {
			int s1=query(u<<1,l,r),s2=query(u<<1|1,l,r);
			if(w[s1]>=w[s2]) return s1;
			else return s2;
		}else if(l<=mid) return query(u<<1,l,r);
		else return query(u<<1|1,l,r);
	}
}

multiset<int> s;
bool flag;

void dfs(int l,int r) {
	if(l>r) return ;
	int ck=query(1,l,r);
	
	if(!b[w[ck]]) {
		int len=r-l+1;
		auto it=s.lower_bound(-len);
		
		if(it==s.end()) {
			flag=false;
			return ;
		}else s.erase(it);
	}
	
	dfs(l,ck-1);
	if(!flag) return ;
	dfs(ck+1,r);
	if(!flag) return ;
}

void solve() {
	n=read(),m=read(),k=read();
	
	for(int i=1;i<=n;i++) w[i]=read(),b[i]=false;
	for(int i=1;i<=m;i++) b[read()]=true;
	
	s.clear();
	for(int i=1;i<=k;i++) s.insert(-read());
	
	build(1,1,n);
	
	flag=true;
	dfs(1,n);
	
	if(!flag) printf("NO\n");
	else printf("YES\n");
}   

int main() {
    // init();
    // stin();
	// ios::sync_with_stdio(false); 

    scanf("%d",&T);
    // T=1; 
    while(T--) hackT++,solve();
    
    return 0;       
}