#include <bits/stdc++.h>

using namespace std;

mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
using ll = long long;
using ld = long double;
using pii = pair<int, int>;

#define S second
#define F first
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")

#define mispertion ios_base::sync_with_stdio(0),cin.tie(0)
#define sz(x) (int)x.size()
#define all(x) x.begin(),x.end()

const ld PI = 3.1415926535;
const ld eps = 1e-9;
const int N = 5e5 + 2;
const int M = 1.5e6 + 13;
ll mod = 1e9+7;
const int infi = 1e9;
const ll infl = 1e16;
const int P = 31;

int mult(int a, int b) {
    return a * 1LL * b % mod; }

int sum(int a, int b) {
    if(a + b >= mod)
        return a + b - mod;
    if(a + b < 0)
        return a + b + mod;
    return a + b;
}

ll binpow(ll a, ll n) {
    if (n == 0) return 1;
    if (n % 2 == 1) {
        return binpow(a, n - 1) * a % (mod);
    } else {
        ll b = binpow(a, n / 2);
        return b * b % (mod);
    }
}

const int K = 19;
int n, m, s[N], t[N], tin[N], tout[N], tick, up[N][K], used[N];
vector<int> g[N], ng[N];

void dfs(int v, int p){
    tin[v] = ++tick;
    up[v][0] = p;
    for(int k = 1; k < K; k++)
        up[v][k] = up[up[v][k - 1]][k - 1];
    for(auto u : g[v]){
        if(u == p) continue;
        dfs(u, v);
    }
    tout[v] = tick;
}

int dfs1(int v){
    used[v] = 1;
    int ok = 1;
    for(auto u : ng[v]){
        if(used[u] == 1){
            return 0;
        }
        if(!used[u])
            ok &= dfs1(u);
    }
    used[v] = 2;
    return ok;
}

bool ispar(int p, int v){
    return (tin[p] <= tin[v] && tout[v] <= tout[p]);
}

int lca(int a, int b){
    if(ispar(a, b))
        return a;
    if(ispar(b, a))
        return b;
    for(int k = K - 1; k >= 0; k--){
        if(!ispar(up[a][k], b)){
            a = up[a][k];
        }
    }
    return up[a][0];
}

bool isinside(int a, int b, int x){
    if(a == x || b == x)
        return true;
    int lc = lca(a, b);
    if(lc == x)
        return true;
    if(ispar(x, a) && !ispar(x, b))
        return true;
    if(ispar(x, b) && !ispar(x, a))
        return true;
    return false;
}

inline void solve() {
    cin >> n;
    for(int i = 1; i <= n; i++)
        g[i].clear(), ng[i].clear(), used[i] = 0;
    for(int i = 1; i < n; i++){
        int a, b;
        cin >> a >> b;
        g[a].push_back(b);
        g[b].push_back(a);
    }
    tick = 0;
    dfs(1, 1);
    cin >> m;
    for(int i = 1; i <= m; i++)
        cin >> s[i] >> t[i];
    for(int i = 1; i <= m; i++){
        for(int j = i + 1; j <= m; j++){
            if(isinside(s[i], t[i], s[j]) && isinside(s[i], t[i], t[j])){
                cout << "No\n";
                return;
            }
            if(isinside(s[j], t[j], s[i]) && isinside(s[j], t[j], t[i])){
                cout << "No\n";
                return;
            }
            if(isinside(s[i], t[i], t[j]) && isinside(s[j], t[j], t[i])){
                cout << "No\n";
                return;
            }
            if(isinside(s[i], t[i], s[j]) && isinside(s[j], t[j], s[i])){
                cout << "No\n";
                return;
            }
            if(isinside(s[i], t[i], s[j])){
                ng[j].push_back(i);
                //cout << j << ' ' << i << '\n';
                continue;
            }
            if(isinside(s[i], t[i], t[j])){
                ng[i].push_back(j);
                //cout << i << ' ' << j << '\n';
                continue;
            }
            if(isinside(s[j], t[j], s[i])){
                ng[i].push_back(j);
                //cout << i << ' ' << j << '\n';
                continue;
            }
            if(isinside(s[j], t[j], t[i])){
                ng[j].push_back(i);
                //cout << j << ' ' << i << '\n';
                continue;
            }
        }
    }
    int ok = 1;
    for(int i = 1; i <= m; i++){
        if(!used[i])
            ok &= dfs1(i);
    }
    cout << (ok ? "Yes\n" : "No\n");
}

signed main() {
    mispertion;
    int t = 1;
    cin >> t;
    for(int i = 1; i <= t; i ++){
        solve();
    }
    return 0;
}