//-DYUNQIAN -std=c++14 -O2 -Wl
#include<bits/stdc++.h>

#define ll long long

using namespace std;

inline int read(){
	int x=0,f=1;char c=getchar();
	for(;(c<'0'||c>'9');c=getchar()){if(c=='-')f=-1;}
	for(;(c>='0'&&c<='9');c=getchar())x=x*10+(c&15);
	return x*f;
}

const int mod=998244353;
int ksm(int x,int y,int p=mod){
	int ans=1;
	for(int i=y;i;i>>=1,x=1ll*x*x%p)if(i&1)ans=1ll*ans*x%p;
	return ans%p;
}
int inv(int x,int p=mod){return ksm(x,p-2,p)%p;}
mt19937 rnd(time(0));
int randint(int l,int r){return rnd()%(r-l+1)+l;}
void add(int &x,int v){x+=v;if(x>=mod)x-=mod;}
void Mod(int &x){if(x>=mod)x-=mod;}

void Assert(bool c,int L=0){if(!c){cout<<"Assertion Failed at "<<L<<endl;exit(0);}}

const int N=5e5+5;
vector<int>G[N];
int M[N],n,dep[N],m;

int sum[N];
void dfs(int u,int fa){for(int v:G[u])if(v!=fa)dep[v]=dep[u]+1,dfs(v,u);}

struct F{int cv,ml,ad;F(int C=0,int M=0,int A=0):cv(C),ml(M),ad(A){}};
bool operator==(F x,F y){return x.cv==y.cv&&x.ad==y.ad&&x.ml==y.ml;}
bool operator!=(F x,F y){return !(x==y);}
int OUT=0,MERGE=0;
struct SegTree{
	int d[N<<5];F lz[N<<5];int tot=0,cnt=0,b[N<<5],ls[N<<5],rs[N<<5];
	
	int e(){return 0;}
	F ef(){return F(-1,1,0);}
	//cov , mul , add
	
	int build(){
		int p=(cnt==0?++tot:b[cnt--]);
		ls[p]=rs[p]=0,d[p]=e(),lz[p]=ef();
		return p;
	}
	void del(int p){
		ls[p]=rs[p]=d[p]=0,lz[p]=ef();
		b[++cnt]=p;
	}
	
	int op(int x,int y){return (x+y>=mod?x+y-mod:x+y);}
	F comp(F f,F g){// f(g(x))
		if(f.cv!=-1)return f;
		if(g.cv!=-1)return F(op(1ll*op(1ll*g.cv*g.ml%mod,g.ad)*f.ml%mod,f.ad),1,0);
		else return F(-1,1ll*g.ml*f.ml%mod,op(1ll*f.ml*g.ad%mod,f.ad));
	}
	void app(F f,int p){
		if(f.cv!=-1)d[p]=f.cv;
		d[p]=op(1ll*d[p]*f.ml%mod,f.ad);
		lz[p]=comp(f,lz[p]);
	}
	
	#define ls(p) (ls[p])
	#define rs(p) (rs[p])
	void pushup(int p){d[p]=max(d[ls(p)],d[rs(p)]);}
	void pushdown(int p){
		if(lz[p]==ef())return ;
		if(!ls(p))ls(p)=build();
		if(!rs(p))rs(p)=build();
		app(lz[p],ls(p)),app(lz[p],rs(p));
		lz[p]=ef();
	}
	
	void Mul(int l,int r,F f,int ql,int qr,int &p){
		if(!p)p=build();
		if(l<=ql&&qr<=r){app(f,p);return ;}
		int mid=(ql+qr)>>1;pushdown(p);
		if(l<=mid)Mul(l,r,f,ql,mid,ls(p));
		if(r>mid)Mul(l,r,f,mid+1,qr,rs(p));
		pushup(p);
	}
	int qval(int x,int ql,int qr,int p){
		if(!p)return 0;
		if(ql==qr)return d[p];
		int mid=(ql+qr)>>1;pushdown(p);
		if(x<=mid)return qval(x,ql,mid,ls(p));
		else return qval(x,mid+1,qr,rs(p));
	}
	
	int merge(int p,int q,int l,int r){
		if(!p||!q)return p+q;
		if(l==r){d[p]=1ll*d[p]*d[q]%mod,del(q);return p;}
		if(((!ls(p))&&(!rs(p)))||((!ls(q))&&(!rs(q)))){
			if(ls(q)||rs(q))swap(p,q);
			int rval=0;
			if(lz[q].cv!=-1)rval=op(1ll*lz[q].cv*lz[q].ml%mod,lz[q].ad);
			else rval=lz[q].ad;
			app(F(-1,rval,0),p),del(q);return p;
		}
		int mid=(l+r)>>1;
		pushdown(p),pushdown(q);
		ls[p]=merge(ls(p),ls(q),l,mid),rs[p]=merge(rs(p),rs(q),mid+1,r);
		pushup(p);del(q);return p;
	}
}T;

int root[N];

void Mul(int l,int r,F f,int u){
	l++,r++;if(l>r)return ;
	T.Mul(l,r,f,1,n,root[u]);
}
int Qval(int v,int u){
	v++;
	return T.qval(v,1,n,root[u]);
}

void DP(int u,int fa){
	Mul(M[u],dep[u]-1,F(1,1,0),u);
	for(int v:G[u]){
		if(v==fa)continue;DP(v,u);
		root[u]=T.merge(root[u],root[v],1,n);
	}
	if(u==1)return ;
	int val=Qval(dep[u]-1,u);
	Mul(dep[u],n-1,F(0,1,0),u),Mul(0,M[u]-1,F(0,1,0),u),Mul(0,dep[u]-1,F(-1,1,val),u);
}

signed main(void){

	n=read();
	for(int i=2;i<=n;i++){
		int x=read(),y=read();
		G[x].emplace_back(y),G[y].emplace_back(x);
	}
	dep[1]=1;dfs(1,0);
	m=read();
	for(int i=1;i<=m;i++){
		int u=read(),v=read();
		M[v]=max(M[v],dep[u]);
	}
	DP(1,0);cout<<Qval(0,1)<<endl;;

	return 0;
}