#include <bits/stdc++.h>
using namespace std;
#define dbgv(v) cout<<#v<<" = "; f(i,0,v.size()) cout<<v[i]<<" "; cout<<endl
#define dbga(a,x,y) cout<<#a<<" = "; f(i,x,y) cout<<a[i]<<" "; cout<<endl
#define erorp(x) cout<<#x<<"={"<<x.F<<" , "<<x.S<<"}"<<endl
#define eror(x) cout<<#x<<'='<<(x)<<endl
#define f_(i,a,b) for(int i=a;i>=b;i--)
#define f(i,a,b) for(int i=a;i<b;i++)
#define nb(x) __builtin_popcount(x)
#define all(v) v.begin(),v.end()
#define bit(n,k) (((n)>>(k))&1)
#define Add(x,y) x=(x+y)%mod
#define maxm(a,b) a=max(a,b)
#define minm(a,b) a=min(a,b)
#define lst(x) x[x.size()-1]
#define sz(x) int(x.size())
#define mp make_pair
#define ll long long
#define pb push_back
#define S second
#define F first
const int N=5e5+99,lg=40;
int n,m,ans,Time,a[N],b[N],t[N],h[N],st[N],ft[N],sz[N],up[N],cnt[N],vis[N],par[N],seg0[N];
vector<int> topo,g[N],seg1[N];
void Dfs(int );
void dfs1(int u,int p){
f(i,0,g[u].size()) if(g[u][i]==p) g[u].erase(g[u].begin()+i);
sz[u]=1;
par[u]=p;
for(auto v : g[u]){
h[v]=h[u]+1;
dfs1(v,u);
sz[u]+=sz[v];
}
sort(all(g[u]),[&](int u,int v){ return sz[u]>sz[v]; });
}
void dfs2(int u){
st[u]=Time++;
for(auto v : g[u]) up[v]=(v==g[u][0] ? up[u] : v),dfs2(v);
ft[u]=Time;
//cout<<u<<" : "<<st[u]<<" "<<ft[u]<<" "<<up[u]<<endl;
}
int pet(int l,int r){
int ans=0;
for(l+=n,r+=n;l<r;l>>=1,r>>=1){
if(l&1) ans+=seg0[l++];
if(r&1) ans+=seg0[--r];
}
return ans;
}
int Get(int u,int v){
int ans=0;
while(up[u]!=up[v]){
if(h[up[u]]<h[up[v]]) swap(u,v);
ans+=pet(st[up[u]],st[u]+1);
u=par[up[u]];
}
if(h[u]>h[v]) swap(u,v);
ans+=pet(st[u],st[v]+1);
return ans;
}
void add(int l,int r,int id){
for(l+=n,r+=n;l<r;l>>=1,r>>=1){
if(l&1){
seg1[l++].pb(id);
}
if(r&1){
seg1[--r].pb(id);
}
}
}
void add0(int x,int val){
for(x+=n;x>0;x>>=1) seg0[x]+=val;
}
void add1(int u,int v,int id){
int cnt=0;
while(up[u]!=up[v]){
cnt++;
if(h[up[u]]<h[up[v]]) swap(u,v);
add(st[up[u]],st[u]+1,id);
u=par[up[u]];
}
if(cnt>lg) assert(0);
if(h[u]>h[v]) swap(u,v);
add(st[u],st[v]+1,id);
}
void pert(int id){
if(seg0[id]==0) return ;
if(n<=id){
Dfs(t[id-n]);
return ;
}
pert(id<<1);
pert(id<<1|1);
}
void get2(int l,int r){
for(l+=n,r+=n;l<r;l>>=1,r>>=1){
if(l&1) pert(l++);
if(r&1) pert(--r);
}
}
void get1(int u,int v){
while(up[u]!=up[v]){
if(h[up[u]]<h[up[v]]) swap(u,v);
get2(st[up[u]],st[u]+1);
u=par[up[u]];
}
if(h[u]>h[v]) swap(u,v);
get2(st[u],st[v]+1);
}
void Dfs(int u){
cnt[u]++;
if(cnt[u]>2*n) assert(0);
if(vis[u]) return ;
add(st[b[u]],-1);
vis[u]=1;
for(int x=st[a[u]]+n;x>0;x>>=1){
while(seg1[x].size()){
int v=seg1[x].back();
seg1[x].pop_back();
Dfs(v);
}
}
get1(a[u],b[u]);
topo.pb(u);
}
void Main(){
cin>>n;
f(i,1,n){
int u,v;
cin>>u>>v;
g[u].pb(v);
g[v].pb(u);
}
up[1]=1;
dfs1(1,1);
dfs2(1);
cin>>m;
f(i,1,m+1){
cin>>a[i]>>b[i];
t[st[b[i]]]=i;
add0(st[b[i]],1);
add1(a[i],b[i],i);
}
f(i,1,m+1){
Dfs(i);
}
reverse(all(topo));
fill(seg0,seg0+(n<<1),0);
f(i,1,m+1) add0(st[a[i]],1);
for(auto x : topo){
add0(st[a[x]],-1);
if(Get(a[x],b[x])){
cout<<"No"<<'\n';
return ;
}
add0(st[b[x]],1);
}
cout<<"Yes"<<'\n';
}
int32_t main(){
ios:: sync_with_stdio(0), cin.tie(0), cout.tie(0);
int tc;
cin>>tc;
while(tc--){
Main();
Time=0;
int mx=2*max(n,m)+10;
topo.clear();
f(i,0,mx) g[i].clear(),seg1[i].clear(),t[i]=vis[i]=cnt[i]=seg0[i]=0;
}
}
Compilation message
jail.cpp: In function 'void dfs1(int, int)':
jail.cpp:8:31: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
8 | #define f(i,a,b) for(int i=a;i<b;i++)
......
31 | f(i,0,g[u].size()) if(g[u][i]==p) g[u].erase(g[u].begin()+i);
| ~~~~~~~~~~~~~~~
jail.cpp:31:2: note: in expansion of macro 'f'
31 | f(i,0,g[u].size()) if(g[u][i]==p) g[u].erase(g[u].begin()+i);
| ^
jail.cpp: In function 'void Dfs(int)':
jail.cpp:120:17: error: too few arguments to function 'void add(int, int, int)'
120 | add(st[b[u]],-1);
| ^
jail.cpp:67:6: note: declared here
67 | void add(int l,int r,int id){
| ^~~
