#define _CRT_SECURE_NO_WARNINGS
#include <bits/stdc++.h>
//#include "temp.cpp"
#include <cstdio>
using namespace std;
#ifndef ONLINE_JUDGE
#define dbg(x) cerr << #x <<" "; print(x); cerr << endl;
#else
#define dbg(x)
#endif
#define sz(x) (int((x).size()))
#define len(x) (int)x.length()
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define clr(x) (x).clear()
#define uniq(x) x.resize(unique(all(x)) - x.begin());
#define pb push_back
#define popf pop_front
#define popb pop_back
#define ld long double
#define ll long long
void print(long long t) {cerr << t;}
void print(int t) {cerr << t;}
void print(string t) {cerr << t;}
void print(char t) {cerr << t;}
void print(double t) {cerr << t;}
void print(unsigned long long t) {cerr << t;}
void print(long double t) {cerr << t;}
template <class T, class V> void print(pair <T, V> p);
template <class T> void print(vector <T> v);
template <class T> void print(set <T> v);
template <class T, class V> void print(map <T, V> v);
template <class T> void print(multiset <T> v);
template <class T> void print(T v[],T n) {cerr << "["; for(int i = 0; i < n; i++) {cerr << v[i] << " ";} cerr << "]";}
template <class T, class V> void print(pair <T, V> p) {cerr << "{"; print(p.first); cerr << ","; print(p.second); cerr << "}";}
template <class T> void print(vector <T> v) {cerr << "[ "; for (T i : v) {print(i); cerr << " ";} cerr << "]";}
template <class T> void print(set <T> v) {cerr << "[ "; for (T i : v) {print(i); cerr << " ";} cerr << "]";}
template <class T> void print(multiset <T> v) {cerr << "[ "; for (T i : v) {print(i); cerr << " ";} cerr << "]";}
template <class T, class V> void print(map <T, V> v) {cerr << "[ "; for (auto i : v) {print(i); cerr << " ";} cerr << "]";}
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
#define nl '\n'
// for grid problems
int dx[8] = {-1,0,1,0,1,-1,1,-1};
int dy[8] = {0,1,0,-1,1,1,-1,-1};
// lowest / (1 << 17) >= 1e5 / (1 << 18) >= 2e5 / (1 << 21) >= 1e6
void fastIO() {
ios_base::sync_with_stdio(false);
cin.tie(nullptr); cout.tie(nullptr);
}
// file in/out
void setIO(string str = "") {
fastIO();
if (str != "") {
freopen((str + ".in").c_str(), "r", stdin);
freopen((str + ".out").c_str(), "w", stdout);
}
}
// Indexed Set
template <class T> using Tree = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
const int N = 2e5 + 10, LOG = 22;
// vector<int> adj[N];
long long n, m, sz[N], p[N], depth[N];
long long id[N], top[N];
vector<int> adj[N];
// Range Queries
struct segTree {
// 0 indexed
// [l: r + 1]
// for 1 index
// [l - 1: r]
vector<long long> mTree;
int size;
void init(long long n) {
size = 1;
while(size < n) {
size *= 2;
}
mTree.assign(2 * size - 1, 0);
}
void upd(int u, long long v, int x, int lx, int rx) { // set value at pos u
if(rx - lx == 1) {
mTree[x] += v;
return;
}
int m = (lx + rx) / 2;
if(u < m) {
upd(u, v, 2 * x + 1, lx, m);
}else {
upd(u, v, 2 * x + 2, m, rx);
}
mTree[x] = mTree[2 * x + 1] + mTree[2 * x + 2];
}
void upd(int u, long long v) {
upd(u, v, 0, 0, size);
}
long long qry (long long l, long long r, int x, int lx, int rx) { // range queries
if(l >= rx || lx >= r) {
return 0;
}
if(lx >= l && r >= rx) {
return mTree[x];
}
int m = (rx + lx) / 2;
long long s1 = qry(l, r, 2 * x + 1, lx, m);
long long s2 = qry(l, r, 2 * x + 2, m, rx);
return s1 + s2;
}
long long qry(long long l, long long r) {
return qry(l, r, 0,0,size);
}
};
segTree seg;
long long dfs_sz(int node, int parent) {
sz[node] = 1, p[node] = parent;
for(auto u: adj[node]) {
if(u == parent) continue;
depth[u] = depth[node] + 1;
sz[node] += dfs_sz(u, node);
}
return sz[node];
}
long long it = 1;
void dfs_hld(int node, int parent, int tp) {
id[node] = it++, top[node] = tp;
// seg.upd(id[node], value[node]);
int heavy_child = -1, heavy_size = -1;
for(auto u: adj[node]) {
if(u == parent) continue;
if(sz[u] > heavy_size) {
heavy_size = sz[u];
heavy_child = u;
}
}
if(heavy_child == -1) {
return;
}
dfs_hld(heavy_child, node, tp);
for(auto u: adj[node]) {
if(u == parent || u == heavy_child) continue;
dfs_hld(u, node, u);
}
}
long long path(int x, int y) {
long long answ = 0;
while(top[x] != top[y]) {
if(depth[top[x]] < depth[top[y]]) {
swap(x, y);
}
// dbg(seg.qry(id[top[x]], id[x] + 1))
answ += seg.qry(id[top[x]], id[x] + 1);
x = p[top[x]];
}
if(depth[x] > depth[y]) {
swap(x, y);
}
answ +=seg.qry(id[x], id[y] + 1);
return answ;
}
void clear() {
for(int i = 1; i <= n; i++) {
adj[i].clear();
sz[i] = p[i] = id[i] = top[i] = 0;
}
}
void solve_() {
clear();
cin >> n, seg.init(n + 10);
for(int i = 1; i <= n - 1; i++) {
int a, b; cin >> a >> b;
adj[a].push_back(b);
adj[b].push_back(a);
}
cin >> m;
vector<pair<int, int>> prisoners;
for(int i = 1; i <= m; i++) {
int a, b; cin >> a >> b;
prisoners.push_back({a, b});
}
dfs_sz(1, 0);
dfs_hld(1, 0, 1);
// dbg("done")
// M^2
for(int i = 0; i < m; i++) {
int ax = prisoners[i].first, bx = prisoners[i].second;
for(int j = i + 1; j < m; j++) {
int a = prisoners[j].first, b = prisoners[j].second;
seg.upd(id[a], 1);
seg.upd(id[b], -1);
// dbg("done")
long long answ = path(ax, bx);
if(answ == 0) {
cout << "No" << endl;
return;
}
seg.upd(id[a], -1);
seg.upd(id[b], 1);
}
}
cout << "Yes" << endl;
}
int main () {
setIO("");
auto solve = [&](int test_case)-> void {
while(test_case--) {
solve_();
}
};
int test_cases = 1; cin >> test_cases;
solve(test_cases);
return 0;
}
