//qoj3501
#include <bits/stdc++.h>
using namespace std;

const int N = 120010, M = 3e7 + 10;
int Tt, n, m, tot;
vector<int> g[N], h[M];
int anc[N][20], dep[N], vs[N], ind[M];
int id[N][20], ask[N], S[N], T[N];
int GL = 19;

void dfs(int x, int fa){
    dep[x] = dep[fa] + 1;
    anc[x][0] = fa;
    id[x][0] = x;
    // printf("[[%d %d\n", x, anc[3][0]);
    for(int i = 1; i <= GL; ++ i){
        anc[x][i] = anc[anc[x][i-1]][i-1];
        if(anc[x][i]){
            id[x][i] = ++ tot;
            h[id[x][i-1]].push_back(id[x][i]);
            h[id[anc[x][i-1]][i-1]].push_back(id[x][i]);
            // printf("%d %d\n", id[x][i-1], id[x][i]);
            // printf("%d %d\n", id[anc[x][i-1]][i-1], id[x][i]);
        }
    }
    for(int i : g[x]){
        if(i != fa){
            dfs(i, x);
        }
    }
}
int lca(int x, int y, int p){
    if(dep[x] > dep[y]){
        swap(x, y);
    }
    for(int i = GL; i >= 0; -- i){
        if(dep[anc[y][i]] >= dep[x]){
            // printf("%d %d\n", id[y][i], p);
            h[id[y][i]].push_back(p);
            y = anc[y][i];
        }
        // printf("jmp %d %d %d %d\n", y, i, anc[y][i], x);
    }
    if(x == y){
        // printf("%d %d\n", x, p);
        h[x].push_back(p);
        return x;
    }
    // printf("now %d %d\n", x, y);
    for(int i = GL; i >= 0; -- i){
        if(anc[x][i] != anc[y][i]){
            // printf("%d %d\n", id[x][i], p);
            // printf("%d %d\n", id[y][i], p);
            h[id[x][i]].push_back(p);
            h[id[y][i]].push_back(p);
            x = anc[x][i];
            y = anc[y][i];
        }
    }
    // printf("-%d %d\n", x, p);
    // printf("--%d %d\n", y, p);
    // printf("---%d %d\n", anc[x][0], p);
    h[x].push_back(p);
    h[y].push_back(p);
    h[anc[x][0]].push_back(p);
    return anc[x][0];
}
int jmp(int x, int p){
    if(p < 0) return -1;
    for(int i = 19; i >= 0; -- i){
        if(p & (1 << i)) x = anc[x][i];
    }
    return x;
}
void CLR(){
    /*
int Tt, n, m, tot;
vector<int> g[N], h[M];
int anc[N][20], dep[N], vs[N], ind[M];
int id[N][20], ask[N], S[N], T[N];
int GL = 19;
    */
    for(int i = 1; i <= n; ++ i){
        vector<int> ().swap(g[i]);
        memset(anc[i], 0, sizeof(anc[i]));
        memset(id[i], 0, sizeof(id[i]));
        dep[i] = vs[i] = 0;
    }
    for(int i = 1; i <= tot; ++ i){
        vector<int> ().swap(h[i]);
        ind[i] = 0;
    }
    tot = 0;
}

int main(){
    scanf("%d", &Tt);
    while(Tt--){
        scanf("%d", &n);
        tot = n;
        for(int i = 1; i < n; ++ i){
            int x, y;
            scanf("%d%d", &x, &y);
            g[x].push_back(y);
            g[y].push_back(x);
        }
        scanf("%d", &m);
        bool flg = 1;
        for(int i = 1; i <= m; ++ i){
            scanf("%d%d", &S[i], &T[i]);
            vs[T[i]] = 1;
            if(S[i] != T[i]){
                flg = 0;
            }
        }
        if(m == n){
            puts(flg ? "Yes" : "No");
            CLR();
            continue;
        }
        int st = 0;
        for(int i = 1; i <= n; ++ i){
            if(!vs[i]){
                st = i;
            }
        }
        // st = 1;
        dfs(st, 0);
        for(int i = 1; i <= m; ++ i){
            ask[i] = ++ tot;
            h[ask[i]].push_back(T[i]);
            int k = anc[T[i]][0];
            if(jmp(S[i], dep[S[i]]-dep[T[i]]) == T[i]){
                k = jmp(S[i], dep[S[i]]-dep[T[i]]-1);
            }
            // printf("%d %d\n", S[i], k);
            int l = lca(S[i], k, ask[i]);
        }
        queue<int> q;
        for(int i = 1; i <= tot; ++ i){
            for(int j : h[i]){
                ++ ind[j];
            }
        }
        for(int i = 1; i <= tot; ++ i){
            if(!ind[i]){
                q.push(i);
            }
        }
        while(!q.empty()){
            int x = q.front();
            q.pop();
            for(int i : h[x]){
                -- ind[i];
                // printf("%d %d %d\n", x, i, ind[i]);
                if(!ind[i]){
                    q.push(i);
                }
            }
        }
        flg = 0;
        for(int i = 1; i <= tot; ++ i){
            if(ind[i]){
                flg = 1;
            }
        }
        puts(flg ? "No" : "Yes");
        CLR();
    }
    return 0;
}