/* Author : Mychecksdead */
#include<bits/stdc++.h>
using namespace std;
#define ll long long int
#define MOD (1000000000+7)
#define MOD1 (998244353)
#define pb push_back
#define all(x) x.begin(), x.end()
#define en cout << '\n'
#define ff first
#define ss second
#define pii pair<int,int>
#define vi vector<int>
const int N = 1e6+100, M = 1e5+10, K = 52, MX = 30;
int n, m, a[N][2];
vi g[N], A[N], B[N], G[N];
int cur, curv;
bool dfs(int v, int p, int t){
if(v == t){
for(int x: A[v]) G[cur].pb(x);
return true;
}
for(int u: g[v]){
if(u != p){
bool ok = dfs(u, v, t);
if(ok){
//process v, it's a node the path of cur
if(curv != v){
for(int x: A[v]) G[cur].pb(x);
}
for(int x: B[v]) G[x].pb(cur);
return true;
}
}
}
return false;
}
bool dead;
void dfs2(int v, vector<int> &vis){
vis[v] = 1;
for(int u: G[v]){
if(vis[u] == 2) continue;
if(vis[u] == 1){
dead = 1;
return;
}
dfs2(u, vis);
}
vis[v] = 2;
}
void solve(){
cin >> n;
for(int i = 1; i <= n; ++i) g[i].clear();
for(int i = 1; i <= n; ++i) A[i].clear();
for(int i = 1; i <= n; ++i) B[i].clear();
for(int i = 1; i <= n; ++i) G[i].clear();
for(int i = 1; i < n; ++i){
int u, v; cin >> u >> v;
g[u].pb(v);
g[v].pb(u);
}
cin >> m;
for(int i = 1; i <= m; ++i){
cin >> a[i][0] >> a[i][1];
A[a[i][0]].pb(i);
B[a[i][1]].pb(i);
}
for(int i = 1; i <= m; ++i){
cur = i;
curv = a[i][0];
dfs(a[i][0], a[i][0], a[i][1]);
}
vector<int> vis(m + 1);
dead = 0;
for(int i = 1; i <= m; ++i){
if(!vis[i]){
dfs2(i, vis);
}
}
if(dead) cout << "No";
else cout << "Yes";
}
int main(){
cin.tie(0); ios::sync_with_stdio(0);
int tt = 1, aa;
// freopen("in.txt", "r", stdin);
// freopen("out.txt", "w", stdout);
cin >> tt;
while(tt--){
solve();
en;
}
cerr<<"time taken : "<<(float)clock()/CLOCKS_PER_SEC<<" seconds\n";
return 0;
}
