#include <bits/stdc++.h>
using namespace std;
int Q;
int N,M;
vector<int> adjlst[120100];
int sise[120100];
int dp[120100];
int pre[120100];
int post[120100];
int parent[120100];
int s[120100];
int t[120100];
int cont = 0;
int pcont[120100];
int rcont[120100];
queue<int> q;
int inf = 1.0e9;
struct pu{
int s, e, m;
int v;
vector<int> vec;
pu *l, *r;
pu(int S, int E){
s = S;
e = E;
m = (s + e)/2;
v = 0;
if(s != e){
l = new pu(s,m);
r = new pu(m + 1, e);
}
}
void set(int S, int E, int i){
if(S <= s && e <= E){
vec.push_back(i);
return;
}
if(S <= m) l -> set(S,E,i);
if(m < E) r -> set(S,E,i);
}
void add(int i){
if(v == 1){
for(int j : vec){
pcont[j]++;
}
}
v++;
if(s != e){
if(i <= m) l -> add(i);
else r -> add(i);
}
}
void rmv(int i){
if(v == 2){
for(int j : vec){
pcont[j]--;
if(pcont[j] == 0 && rcont[j] == 0) q.push(j);
}
}
v--;
if(s != e){
if(i <= m) l -> rmv(i);
else r -> rmv(i);
}
}
} *root;
struct ru{
int s,e,m;
int it = -1;
pair<int,int> v;
int lazy = 0;
ru *l, *r;
ru(int S, int E){
s = S;
e = E;
m = (s + e)/2;
v = {0,s};
if(s != e){
l = new ru(s,m);
r = new ru(m + 1,e);
}
}
void setit(int i, int k){
if(s == e){
it = k;
return;
}
if(i <= m) l -> setit(i,k);
else r -> setit(i,k);
}
void add(int S, int E){
if(S <= s && e <= E){
lazy++;
v.first++;
return;
}
if(S <= m) l -> add(S,E);
if(m < E) r -> add(S,E);
v = min(l -> v, r -> v);
v.first += lazy;
}
void activate(int k){
k += lazy;
if(s == e){
if(k >= 2 && it != -1) rcont[it] = 1;
return;
}
l -> activate(k);
r -> activate(k);
}
void rmv(int S,int E){
if(S <= s && e <= E){
lazy--;
v.first--;
return;
}
if(S <= m) l -> rmv(S,E);
if(m < E) r -> rmv(S,E);
v = min(l -> v, r -> v);
v.first += lazy;
}
void aa(int i){
if(s == e){
v.first = inf;
if(it != -1){
rcont[it] = 0;
if(rcont[it] == 0 && pcont[it] == 0) q.push(it);
}
return;
}
if(i <= m) l -> aa(i);
else r -> aa(i);
v = min(l -> v, r -> v);
v.first += lazy;
}
} *root1;
void dfs(int i, int p){
sise[i] = 1;
parent[i] = p;
for(int j : adjlst[i]){
if(j == p) continue;
dfs(j,i);
sise[i] += sise[j];
}
}
void dfs1(int i, int p, bool flag){
if(flag) dp[i] = dp[p];
else dp[i] = i;
pair<int,int> ii = {-1,-1};
for(int j : adjlst[i]){
if(j == p) continue;
ii = max(make_pair(sise[j],j),ii);
}
pre[i] = cont;
cont++;
if(ii.second != -1) dfs1(ii.second,i,1);
for(int j : adjlst[i]){
if(j == p) continue;
if(j == ii.second) continue;
dfs1(j,i,0);
}
post[i] = cont-1;
}
vector<pair<int,int>> hld(int u, int v){
vector<pair<int,int>> vec;
while(true){
if(pre[u] > pre[v]) swap(u,v);
if(dp[u] == dp[v]){
vec.push_back({pre[u],pre[v]});
break;
}
vec.push_back({pre[dp[v]],pre[v]});
v = parent[dp[v]];
}
return vec;
}
int main(){
scanf(" %d",&Q);
while(Q--){
scanf(" %d",&N);
for(int i = 1; i <= N; i++) adjlst[i].clear();
while(!q.empty()) q.pop();
cont = 0;
for(int i = 1; i <= N - 1; i++){
int u,v;
scanf(" %d",&u);
scanf(" %d",&v);
adjlst[u].push_back(v);
adjlst[v].push_back(u);
}
dfs(1,-1);
dfs1(1,-1,0);
scanf(" %d",&M);
for(int i = 1; i <= M; i++){
scanf(" %d",&s[i]);
scanf(" %d",&t[i]);
pcont[i] = 0;
rcont[i] = 0;
}
root = new pu(0,N-1);
root1 = new ru(0,N-1);
//for(int i = 1; i <= N; i++) printf("%d ",pre[i]);
//printf("\n");
for(int i = 1; i <= M; i++){
vector<pair<int,int>> vec = hld(s[i],t[i]);
for(pair<int,int> ii : vec) root -> set(ii.first,ii.second,i);
root -> add(pre[s[i]]);
root1 -> setit(pre[t[i]],i);
for(pair<int,int> ii : vec){
root1 -> add(ii.first,ii.second);
//printf("%d %d e\n",ii.first,ii.second);
}
}
root1 -> activate(0);
//printf("%lld %d\n",root1 -> v.first, root1 -> v.second);
while(root1 -> v.first <= 1){
//printf("%d %d\n",root1 -> v.first, root1 -> v.second);
root1 -> aa(root1 -> v.second);
}
int num = 0;
while(!q.empty()){
int i = q.front();
q.pop();
num++;
root -> rmv(pre[s[i]]);
vector<pair<int,int>> vec = hld(s[i],t[i]);
for(pair<int,int> ii : vec) root1 -> rmv(ii.first,ii.second);
while(root1 -> v.first <= 1){
root1 -> aa(root1 -> v.second);
}
}
//printf("%d\n",num);
if(num == M) printf("Yes\n");
else printf("No\n");
}
}
