#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define ULL unsigned ll
#define debug(...) fprintf(stderr,__VA_ARGS__)
#define ok debug("OK\n")
inline ll read() {
	ll x(0),f(1);char c=getchar();
	while(!isdigit(c)) {if(c=='-') f=-1;c=getchar();}
	while(isdigit(c)) {x=(x<<1)+(x<<3)+c-'0';c=getchar();}
	return x*f;
}
const int N=2050;
const int mod=100000000;
const ll inf=1e9;

bool mem1;

bool Flag=0;

int n,m;

vector<int>e[N];
int dep[N];
void init(int x,int f){
	dep[x]=dep[f]+1;
	for(int to:e[x]){
		if(to==f) continue;
		init(to,x);
	}
	return;
}
int a[N],b[N];
int col[N];
int u[N*N],v[N*N],tot;
inline void move(int x,int y){
	assert(col[x]&&!col[y]);
	col[x]^=1;
	col[y]^=1;
	++tot;
	u[tot]=x;v[tot]=y;
}
inline void rollback(int goal){
	while(tot!=goal){
		col[u[tot]]^=1;
		col[v[tot]]^=1;
		--tot;
	}
	return;
}
int nod[N];
bool cmp(int x,int y){
	return dep[x]>dep[y];
}
bool exi[N],tag[N];
bool clear(int x,int fa);
bool leave(int x,int fa){//make a black x leave
	if(tag[x]) return false;
	for(int to:e[x]){
		if(to==fa||tag[to]) continue;
		if(clear(to,x)){
			move(x,to);
			return true;
		}
	}
	return false;
}
bool clear(int x,int fa){//make white x's neighbour white
	if(tag[x]) return false;
	int tim=tot;
	for(int to:e[x]){
		if(to==fa) continue;
		if(tag[to]&&col[to]){
			rollback(tim);
			return false;
		}
		if(!col[to]) continue;
		if(leave(to,x)) continue;
		rollback(tim);
		return false;
	}
	return true;
}

bool dfs(int x,int fa){
	if(tag[x]) return false;
	if(col[x]) return true;
	int tim=tot;
	int cnt(0);
	for(int to:e[x]){
		if(to==fa) continue;
		if(tag[to]&&col[to]) return false;
		cnt+=col[to];
	}
	//printf("  dfs: x=%d fa=%d col=%d cnt=%d\n",x,fa,col[x],cnt);
	if(!cnt){
		for(int to:e[x]){
			if(to==fa||tag[to]) continue;
			if(dfs(to,x)){
				move(to,x);
				return true;
			}			
		}
		return false;
	}
	else{
		int now=0;
		for(int to:e[x]){
			if(to==fa||tag[to]) continue;
			if(!col[to]) continue;
			--cnt;
			if(cnt==0&&!now) now=to;
			else if(!leave(to,x)){
				if(!now) now=to;
				else{
					rollback(tim);
					return false;
				}
			}
		}
		move(now,x);
		return true;
	}
	rollback(tim);
	return false;
}

void work(){
	n=read();tot=0;
	for(int i=1;i<=n;i++){
		e[i].clear();
	}
	for(int i=1;i<n;i++){
		int x=read(),y=read();
		e[x].push_back(y);
		e[y].push_back(x);
	}
	m=read();
	for(int i=1;i<=m;i++) a[i]=read();
	for(int i=1;i<=m;i++) b[i]=read();
	
	init(1,0);
	
	for(int i=1;i<=n;i++){
		col[i]=0;
		tag[i]=0;
		nod[i]=i;
		exi[i]=0;
	}
	for(int i=1;i<=m;i++) col[a[i]]=1;
	sort(nod+1,nod+1+n,cmp);
	for(int i=1;i<=n;i++){
		int x=nod[i];
		exi[x]=dfs(x,0);
		//printf("x=%d exi=%d\n",x,exi[x]);
		tag[x]=1;
	}
	int pos=tot;
	//printf("--- pos=%d\n",pos);
	for(int i=1;i<=n;i++){
		col[i]=0;
		tag[i]=0;
	}
	for(int i=1;i<=m;i++) col[b[i]]=1;
	for(int i=1;i<=n;i++){
		int x=nod[i];		
		if(!exi[x]){
			continue;
			tag[x]=1;
		}
		//printf("x=%d\n",x);
		if(!dfs(x,0)){
			puts("NO");
			return;
		}
		tag[x]=1;
	}
	for(int i=pos+1;i<=tot;i++) swap(u[i],v[i]);
	reverse(u+pos+1,u+tot+1);
	reverse(v+pos+1,v+tot+1);
	puts("YES");
	printf("%d\n",tot);
	for(int i=1;i<=tot;i++) printf("%d %d\n",u[i],v[i]);
	return;
}

int main(){
	#ifndef ONLINE_JUDGE
	freopen("a.in","r",stdin);
	freopen("a.out","w",stdout);
	#endif
	int T=read();
	while(T--) work();
	
	return 0;
}
/*
*/