//#pragma GCC optimize("Ofast,O2,O3,unroll-loops")
//#pragma GCC target("avx2")
#include <bits/stdc++.h>
using namespace std;
void debug_out() { cerr << endl; }
template<typename Head, typename... Tail>
void debug_out(Head H, Tail... T) {
cerr << "[" << H << "]";
debug_out(T...);
}
#ifdef dddxxz
#define debug(...) cerr << "[" << #__VA_ARGS__ << "]:", debug_out(__VA_ARGS__)
#else
#define debug(...) 42
#endif
#define SZ(s) ((int)s.size())
#define all(x) (x).begin(), (x).end()
#define lla(x) (x).rbegin(), (x).rend()
#define bpc(x) __builtin_popcount(x)
#define bpcll(x) __builtin_popcountll(x)
#define MP make_pair
clock_t startTime;
double getCurrentTime() {
return (double) (clock() - startTime) / CLOCKS_PER_SEC;
}
mt19937 rng(chrono::high_resolution_clock::now().time_since_epoch().count());
typedef long long ll;
const int MOD = 1e9 + 7;
const int INF = 1000000101;
const long long LLINF = 1223372000000000555;
const int N = 2e5 + 3e2;
const int M = 5555;
vector<int> g[N];
int tin[N], tout[N], timer = 0;
int up[N][18], depth[N];
inline void dfs(int v, int p){
tin[v] = ++timer;
depth[v] = depth[p] + 1;
up[v][0] = p;
for (int i = 1; i < 18; i++){
up[v][i] = up[up[v][i - 1]][i - 1];
}
for (int u : g[v]){
if (u != p) dfs(u, v);
}
tout[v] = ++timer;
}
inline bool upper(int u, int v){
return tin[u] <= tin[v] && tout[v] <= tout[u];
}
inline int lca(int u, int v){
if (upper(u, v)) return u;
if (upper(v, u)) return v;
for (int i = 17; i >= 0; i--){
if (!upper(up[u][i], v)) u = up[u][i];
}
return up[u][0];
}
inline int dist(int u, int v){
return depth[u] + depth[v] - 2 * depth[lca(u, v)];
}
inline bool in(int a, int b, int c){
return dist(a, c) == dist(a, b) + dist(b, c);
}
int color[N];
bool dfs(int v){
color[v] = 1;
for (int u : g[v]){
if (color[u] == 1) return true;
if (color[u] == 0 && dfs(u)) return true;
}
color[v] = 2;
return false;
}
struct SparseTable{
vector<vector<int>> mn, mx;
vector<int> Log;
void init(vector<int> &a){
int n = a.size();
mn.assign(n, vector<int>(20, 0));
mx.assign(n, vector<int>(20, 0));
Log.resize(n + 1);
Log[1] = 0;
for (int i = 2; i <= n; i++) Log[i] = Log[i / 2] + 1;
for (int i = 0; i < n; i++){
mn[i][0] = mx[i][0] = a[i];
}
for (int j = 1; j < 20; j++){
for (int i = 0; i < n; i++){
if (i + (1 << j) - 1 >= n) continue;
mn[i][j] = min(mn[i][j - 1], mn[i + (1 << (j - 1))][j - 1]);
mx[i][j] = max(mx[i][j - 1], mx[i + (1 << (j - 1))][j - 1]);
}
}
}
int get_min(int l, int r){
if (l > r) return 1e9;
int x = Log[r - l + 1];
return min(mn[l][x], mn[r - (1 << x) + 1][x]);
}
int get_max(int l, int r){
if (l > r) return -1e9;
int x = Log[r - l + 1];
return max(mx[l][x], mx[r - (1 << x) + 1][x]);
}
};
void solve(int TC) {
int n;
cin >> n;
timer = 0;
for (int i = 0; i < n; i++) g[i].clear();
bool ok1 = true;
for (int i = 0; i < n - 1; i++){
int a, b;
cin >> a >> b;
--a, --b;
g[a].push_back(b);
g[b].push_back(a);
if (a != i || b != i + 1) ok1 = false;
}
dfs(0, 0);
int m;
cin >> m;
vector<int> S(m), T(m);
vector<int> ids(n, -1), idt(n, -1);
for (int i = 0; i < m; i++){
cin >> S[i] >> T[i];
S[i]--, T[i]--;
ids[S[i]] = i;
idt[T[i]] = i;
}
if (ok1){
vector<int> left(n, 0), right(n, 0);
vector<int> vv(n, INF);
for (int i = 0; i < m; i++){
if (S[i] < T[i]){
right[S[i]]++;
right[T[i]]--;
vv[S[i]] = T[i];
} else {
left[T[i]]++;
left[S[i]]--;
vv[T[i]] = S[i];
}
}
for (int i = 1; i < n; i++) left[i] += left[i - 1], right[i] += right[i - 1];
for (int i = 0; i < n; i++){
if (left[i] && right[i]){
cout << "No\n";
return;
}
}
SparseTable st;
st.init(vv);
for (int i = 0; i < m; i++){
int l = min(S[i], T[i]), r = max(S[i], T[i]);
if (st.get_min(l + 1, r - 1) < r){
cout << "No\n";
return;
}
}
cout << "Yes\n";
return;
}
for (int i = 0; i < m; i++){
g[i].clear();
color[i] = 0;
}
for (int i = 0; i < m; i++){
int s = S[i], t = T[i];
int l = lca(s, t);
vector<int> ss, tt;
while (upper(l, s)){
int j = ids[s];
if (j != -1 && j != i) ss.push_back(j);
j = idt[s];
if (j != -1 && j != i) tt.push_back(j);
if (s == 0) break;
s = up[s][0];
}
while (upper(l, t)){
int j = ids[t];
if (j != -1 && j != i) ss.push_back(j);
j = idt[t];
if (j != -1 && j != i) tt.push_back(j);
if (t == 0) break;
t = up[t][0];
}
if (!ss.empty()){
g[ss[0]].push_back(i);
for (int j = 1; j < ss.size(); j++){
g[ss[j]].push_back(ss[j - 1]);
}
}
if (!tt.empty()){
g[i].push_back(tt[0]);
for (int j = 0; j + 1 < ss.size(); j++){
g[tt[j]].push_back(tt[j + 1]);
}
}
}
for (int i = 0; i < m; i++){
if (color[i] == 0 && dfs(i)){
cout << "No\n";
return;
}
}
cout << "Yes\n";
}
int main() {
startTime = clock();
ios_base::sync_with_stdio(false); cin.tie(nullptr); cout.tie(nullptr);
#ifdef dddxxz
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
int TC = 1;
cin >> TC;
for (int test = 1; test <= TC; test++) {
//debug(test);
//cout << "Case #" << test << ": ";
solve(test);
}
#ifdef dddxxz
cerr << endl << "Time: " << int(getCurrentTime() * 1000) << " ms" << endl;
#endif
return 0;
}
