#include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define mp make_pair
#define pb push_back
#define eb emplace_back
#define pii pair <int, int>
#define X first
#define Y second
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
void abc() {cout << endl;}
template <typename T, typename ...U> void abc(T a, U ...b) {
cout << a << ' ', abc(b...);
}
template <typename T> void printv(T l, T r) {
for (; l != r; ++l) cout << *l << " \n"[l + 1 == r];
}
template <typename A, typename B> istream& operator >> (istream& o, pair<A, B> &a) {
return o >> a.X >> a.Y;
}
template <typename A, typename B> ostream& operator << (ostream& o, pair<A, B> a) {
return o << '(' << a.X << ", " << a.Y << ')';
}
template <typename T> ostream& operator << (ostream& o, vector<T> a) {
bool is = false;
if (a.empty()) return o << "{}";
for (T i : a) {o << (is ? ' ' : '{'), is = true, o << i;}
return o << '}';
}
template <typename T> struct vv : vector <vector <T>> {
vv (int n, int m, T v) : vector <vector <T>> (n, vector <T>(m, v)) {}
vv (int n, int m) : vector <vector <T>> (n, vector <T>(m)) {}
vv () {}
};
template <typename T> struct vvv : vector <vv <T>> {
vvv (int n, int m, int k, T v) : vector <vv <T>> (n, vv <T>(m, k, v)) {}
vvv (int n, int m, int k) : vector <vv <T>> (n, vv <T>(m, k)) {}
vvv () {}
};
#ifdef Doludu
#define test(args...) abc("[" + string(#args) + "]", args)
#define owo freopen("input.txt", "r", stdin), freopen("output.txt", "w", stdout)
#else
#define test(args...) void(0)
#define owo ios::sync_with_stdio(false); cin.tie(0)
#endif
const int mod = 1e9 + 7, N = 130002;
vector <int> adj[N];
struct BinaryLifting {
// 0-index
vector <int> in, out, dep;
vector <vector <int>> jump;
int _t, n, lg;
BinaryLifting () = default;
BinaryLifting (int _n) : n(_n) {
lg = __lg(n) + 1, _t = 0;
jump.assign(n, vector <int> (lg, -1));
in.assign(n, 0), out.assign(n, 0), dep.assign(n, 0);
dfs(0, -1);
}
void dfs(int v, int pa) {
in[v] = _t++, jump[v][0] = pa;
dep[v] = ~pa ? dep[pa] + 1 : 0;
for (int i = 1; i < lg; ++i) {
int k = jump[v][i - 1];
jump[v][i] = ~k ? jump[k][i - 1] : k;
}
for (int u : adj[v]) if (u != pa) {
dfs(u, v);
}
out[v] = _t++;
}
bool anc(int u, int v) {
return in[u] <= in[v] && out[u] >= out[v];
}
int lca(int u, int v) {
if (anc(u, v))
return u;
if (anc(v, u))
return v;
for (int i = lg - 1; ~i; --i) {
int k = jump[u][i];
if (~k && !anc(k, v))
u = k;
}
return jump[u][0];
}
int lift(int u, int d) {
for (int i = 0; i < lg; ++i) if (d >> i & 1)
u = jump[u][i];
return u;
}
int dis(int u, int v) {
return dep[u] + dep[v] - dep[lca(u, v)] * 2;
}
};
void solve() {
int n, m;
cin >> n;
for (int i = 0, u, v; i < n - 1; ++i) {
cin >> u >> v, --u, --v;
adj[u].pb(v), adj[v].pb(u);
}
BinaryLifting solver(n);
cin >> m;
vector <int> u(m), v(m);
for (int i = 0; i < m; ++i) {
cin >> u[i] >> v[i], --u[i], --v[i];
}
vector <vector <int>> g(m);
for (int i = 0; i < m; ++i) for (int j = 0; j < m; ++j) if (i ^ j) {
// u[j] on (u[i], v[i]) => j -> i
// v[j] on (u[i], v[i]) => i -> j
int lca = solver.lca(u[i], v[i]);
if (lca == u[j] || (solver.anc(lca, u[j]) && solver.anc(u[j], u[i])) || (solver.anc(lca, u[j]) && solver.anc(u[j], v[i]))) {
g[i].pb(j);
}
if (lca == v[j] || (solver.anc(lca, v[j]) && solver.anc(v[j], u[i])) || (solver.anc(lca, v[j]) && solver.anc(v[j], v[i]))) {
g[j].pb(i);
}
}
vector <int> in(m);
for (int i = 0; i < m; ++i) for (int j : g[i])
in[j]++;
queue <int> q;
for (int i = 0; i < m; ++i) if (!in[i])
q.push(i);
int ans = 0;
while (!q.empty()) {
int v = q.front(); q.pop();
ans++;
for (int u : g[v]) {
in[u]--;
if (!in[u])
q.push(u);
}
}
cout << (ans == m ? "Yes\n" : "No\n");
for (int i = 0; i < n; ++i)
adj[i].clear();
}
int main () {
owo;
int t = 1;
cin >> t;
while (t--)
solve();
}
