#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define ll long long
#define ld long double
#define ull unsigned long long
#define ff first
#define ss second
#define pii pair<int,int>
#define pll pair<long long, long long>
#define vi vector<int>
#define vl vector<long long>
#define pb push_back
#define rep(i, b) for(int i = 0; i < (b); ++i)
#define rep2(i,a,b) for(int i = a; i <= (b); ++i)
#define rep3(i,a,b,c) for(int i = a; i <= (b); i+=c)
#define count_bits(x) __builtin_popcountll((x))
#define all(x) (x).begin(),(x).end()
#define siz(x) (int)(x).size()
#define forall(it,x) for(auto& it:(x))
using namespace __gnu_pbds;
using namespace std;
typedef tree<int, null_type, less<int>, rb_tree_tag,tree_order_statistics_node_update> ordered_set;
//mt19937 mt;void random_start(){mt.seed(chrono::time_point_cast<chrono::milliseconds>(chrono::high_resolution_clock::now()).time_since_epoch().count());}
//ll los(ll a, ll b) {return a + (mt() % (b-a+1));}
const int INF = 1e9+50;
const ll INF_L = 1e18+40;
const ll MOD = 1e9+7;
vi graph_tree[120001];
int pre[120001];
int max_pre[120001];
int cur_pre = 0;
int sub[120001];
int root[120001];
int jump[120001][17];
vi graph[1000005];
short odw[1000005];
int cur_v = 0;
int tree_siz = 1024*256-1;
int in_tree[1024*256];
int out_tree[1024*256];
int Sin[1024*256/2];
int Tout[1024*256/2];
void gen_tree(int v, int l, int r)
{
in_tree[v] = cur_v++;
out_tree[v] = cur_v++;
if(l == r)
{
if(Sin[l] != -1) graph[in_tree[v]].pb(Sin[l]);
if(Tout[l] != -1) graph[Tout[l]].pb(out_tree[v]);
return;
}
gen_tree(v*2,l,(l+r)/2);
gen_tree(v*2+1,(l+r)/2+1,r);
graph[in_tree[v]].pb(in_tree[v*2]);
graph[in_tree[v]].pb(in_tree[v*2+1]);
graph[out_tree[v*2]].pb(out_tree[v]);
graph[out_tree[v*2+1]].pb(out_tree[v]);
}
void link_in(int akt, int p1, int p2, int s1, int s2, int v)
{
if(p2 < s1 || p1 > s2) return;
if(p1 >= s1 && p2 <= s2)
{
graph[v].pb(in_tree[akt]);
return;
}
link_in(akt*2,p1,(p1+p2)/2,s1,s2,v);
link_in(akt*2+1,(p1+p2)/2+1,p2,s1,s2,v);
}
void link_out(int akt, int p1, int p2, int s1, int s2, int v)
{
if(p2 < s1 || p1 > s2) return;
if(p1 >= s1 && p2 <= s2)
{
graph[out_tree[akt]].pb(v);
return;
}
link_out(akt*2,p1,(p1+p2)/2,s1,s2,v);
link_out(akt*2+1,(p1+p2)/2+1,p2,s1,s2,v);
}
int dfs_sub(int v, int pop)
{
sub[v] = 1;
forall(it,graph_tree[v]) if(it != pop) sub[v] += dfs_sub(it,v);
return sub[v];
}
void dfs_HLD(int v, int pop, int top)
{
jump[v][0] = pop;
pre[v] = cur_pre++;
root[v] = top;
pii best = {-1,-1};
forall(it,graph_tree[v])
{
if(it != pop)
{
best = max(best,{sub[it],it});
}
}
max_pre[v] = pre[v];
if(best.ff == -1) return;
dfs_HLD(best.ss,v,top);
max_pre[v] = max_pre[best.ss];
forall(it,graph_tree[v])
{
if(it != pop && it != best.ss)
{
dfs_HLD(it,v,it);
max_pre[v] = max_pre[it];
}
}
}
int lcaF(int a, int b, bool is = 1)
{
int lca = a;
if(pre[a] >= pre[lca] && pre[a] <= max_pre[lca] && pre[b] >= pre[lca] && pre[b] <= max_pre[lca]) return lca;
for(int bit = 16; bit >= 0; bit--)
{
int l2 = jump[lca][bit];
if(!(pre[a] >= pre[l2] && pre[a] <= max_pre[l2] && pre[b] >= pre[l2] && pre[b] <= max_pre[l2])) lca = l2;
}
if(is) return jump[lca][0];
else return lca;
}
void get_path(int a, int l, vector<pii>& ans)
{
while(pre[root[a]] >= pre[l] && pre[root[a]] <= max_pre[l])
{
ans.pb({pre[root[a]],pre[a]});
if(root[a] == 1) return;
a = jump[root[a]][0];
}
if(!(pre[a] >= pre[l] && pre[a] <= max_pre[l])) return;
ans.pb({pre[l],pre[a]});
}
void get_segs(int a, int b, vector<pii>& ans)
{
int lca = lcaF(a,b);
get_path(a,lca,ans);
get_path(b,lca,ans);
}
bool is_ok = 1;
void dfs_ans(int v)
{
odw[v] = 2;
forall(it,graph[v])
{
if(odw[it] == 2)
{
is_ok = 0;
return;
}
if(odw[it] == 0) dfs_ans(it);
}
odw[v] = 1;
}
int nxt_on_path(int a, int b)
{
if(pre[b] >= pre[a] && pre[b] <= max_pre[a])
{
return lcaF(b,a,0);
}
else return jump[a][0];
}
void solve()
{
int n;
cin >> n;
rep2(i,1,n) graph_tree[i] = {};
rep(i,cur_v+1) graph[i] = {};
rep(i,cur_v+1) odw[i] = 0;
cur_pre = 0;
cur_v = n+1;
tree_siz = (1 << (__lg(n)+2))-1;
rep(i,tree_siz/2)
{
Sin[i] = -1;
Tout[i] = -1;
}
rep(i,n-1)
{
int a,b;
cin >> a >> b;
graph_tree[a].pb(b);
graph_tree[b].pb(a);
}
dfs_sub(1,1);
dfs_HLD(1,1,1);
rep2(bit,1,16)
{
rep2(i,1,n) jump[i][bit] = jump[jump[i][bit-1]][bit-1];
}
int q;
cin >> q;
vector<pii> p;
rep(qq,q)
{
int s,t;
cin >> s >> t;
p.pb({s,t});
Sin[pre[s]] = qq;
Tout[pre[t]] = qq;
}
gen_tree(1,0,tree_siz/2);
rep(i,q)
{
vector<pii> segsS;
get_segs(nxt_on_path(p[i].ff,p[i].ss),p[i].ss,segsS);
vector<pii> segsO;
get_segs(p[i].ff,nxt_on_path(p[i].ss,p[i].ff),segsO);
forall(it,segsS)
{
link_in(1,0,tree_siz/2,it.ff,it.ss,i);
}
forall(it,segsO)
{
link_out(1,0,tree_siz/2,it.ff,it.ss,i);
}
}
is_ok = 1;
rep(i,cur_v)
{
if(odw[i] == 0)
{
dfs_ans(i);
}
}
if(is_ok) cout << "Yes\n";
else cout << "No\n";
}
int main()
{
ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
//random_start();
int t;
cin >> t;
while(t--)
{
solve();
}
}
