#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pii pair<ll, ll>
#define f first
#define s second
#define MX(a,b) a = max(a,b)
#define MN(a,b) a = min(a,b)
#define SZ(x) (int)(x).size()
#define ALL(x) (x).begin(), (x).end()
#define pb push_back
#define FOR(i,a,b) for (int i = a; i<b; ++i)
#define REP(i,n) FOR(i,0,n)
#define REP1(i,n) FOR(i,1,n+1)
#ifdef BALBIT
#define bug(...) cerr<<"#"<<__LINE__<<": "<<#__VA_ARGS__<<"- ", _do(__VA_ARGS__)
template<typename T> void _do( T && x) {cerr<<x<<endl;}
template<typename T, typename ...S> void _do( T && x, S && ...y) {cerr<<x<<", "; _do(y...);}
#else
#define bug(...)
#define endl '\n'
#endif // BALBIT
const int maxn = 2e5+5;
vector<int> tree[maxn];
int dep[maxn];
int fa[18][maxn];
void dfs(int v, int p) {
for (int u : tree[v]) {
if (u == p) continue;
dep[u] = dep[v] + 1;
fa[0][u] = v;
dfs(u,v);
}
}
int st[maxn], en[maxn]; // starting or ending???
int snode[maxn], enode[maxn];
void CLR(int n){
REP(i,n) {
tree[i].clear(); dep[i] = 0;
st[i] = en[i] = -1;
}
}
vector<int> g[maxn];
int indeg[maxn];
signed main(){
ios::sync_with_stdio(0), cin.tie(0);
bug(1,2);
int T; cin>>T;
while (T--) {
int n; cin>>n;
CLR(n);
REP(i,n-1) {
int a,b; cin>>a>>b; --a; --b;
tree[a].pb(b); tree[b].pb(a);
}
dfs(0,-1);
int q; cin>>q;
REP(i,q) {
cin>>snode[i]>>enode[i]; --snode[i]; --enode[i];
st[snode[i]] = i; en[enode[i]] = i;
}
REP(i,q) g[i].clear();
REP(i,q) {
int a = snode[i], b = enode[i];
bool yo = 0;
while (a!=b || yo) {
if (dep[a] < dep[b]) swap(a,b);
// walk a
if (~st[a] && st[a] != i) {
g[i].pb(st[a]);
bug(i, st[a]);
}
if (~en[a] && en[a] != i) {
g[en[a]].pb(i);
bug(en[a], i);
}
if (yo) break;
a = fa[0][a];
if (a == b) yo = 1;
}
}
REP(i,q) {
indeg[i] = 0;
}
REP(i,q) {
for (int u : g[i]) {
++indeg[u];
}
}
queue<int> qq;
REP(i,q) {
if (indeg[i] == 0) {
qq.push(i);
}
}
int done = 0;
while (!qq.empty() ){
int v = qq.front(); qq.pop();
++done;
for (int u : g[v]) {
if (--indeg[u] == 0) {
qq.push(u);
}
}
}
bug(done);
cout<<(done==q?"Yes":"No")<<endl;
}
}
