#include<bits/stdc++.h>
#define Gc() getchar() 
#define Me(x,y) memset(x,y,sizeof(x))
#define Mc(x,y) memcpy(x,y,sizeof(x))
#define d(x,y) ((m)*(x-1)+(y))
#define R(n) (rnd()%(n)+1)
#define Pc(x) putchar(x)
#define LB lower_bound
#define UB upper_bound
#define fi first
#define se second
#define eb emplace_back
using namespace std;using ll=long long;using db=double;using lb=long db;using ui=unsigned;using ull=unsigned long long;using pii=pair<int,int>;using LL=__int128;
const int N=2e5+5,M=N*100+5,K=(1<<25)+5,mod=1e9+7,Mod=mod-1;const db eps=1e-9;const int INF=1e9+7;mt19937 rnd(time(0));
int n,x,y;
vector<int> S[N];
int fa[N],d[N],Sn[N],Si[N],Tp[N],Bg[N],Bh,En[N],Df[N];
void dfs1(int x,int La)
{
	fa[x]=La;d[x]=d[La]+1;Si[x]=1;
	for(int i:S[x]) if(i^La) dfs1(i,x),Si[x]+=Si[i],Si[Sn[x]]<Si[i]&&(Sn[x]=i);
}
void dfs2(int x,int La)
{
	Df[Bg[x]=++Bh]=x;Tp[x]=La;if(Sn[x]) dfs2(Sn[x],La);
	for(int i:S[x]) if(i^fa[x]&&i^Sn[x]) dfs2(i,i);En[x]=Bh;
}
int LCA(int x,int y)
{
	while(Tp[x]^Tp[y]) d[Tp[x]]>d[Tp[y]]?(x=fa[Tp[x]]):(y=fa[Tp[y]]);
	return d[x]<d[y]?x:y;
} 
ll f[N],g[N],w[N],p[N],Sum[N];int up[N];
vector<int> Q[N],D[N];
ll dist(int x,int y){int Ls=LCA(x,y);return Sum[x]+Sum[y]-2*Sum[Ls];}
struct node
{
	int l,r;ll w;
	node operator +(const node &B)const
	{
		if(!l) return B;if(!B.l) return (node){l,r,w};
		return (node){l,B.r,w+B.w+dist(r,B.l)};
	}
};
namespace Tree
{
	node f[M];int g[M],Ct,L[M],R[M];
	void Up(int v){f[v]=f[L[v]]+f[R[v]];}
	void PF(int v,int w,int l){g[v]+=w;f[v]=(g[v]?(node){Df[l],Df[l],0}:(node){0,0,0});}
	void Add(int x,int w,int &v,int l=1,int r=n)
	{
		if(!v) v=++Ct;if(l==r) return PF(v,w,l);
		int m=l+r>>1;x<=m?Add(x,w,L[v],l,m):Add(x,w,R[v],m+1,r);Up(v);
	}
	int merge(int x,int y,int l=1,int r=n)
	{
		if(!x||!y) return x|y;if(l==r) return PF(x,g[y],l),x;int m=l+r>>1;
		L[x]=merge(L[x],L[y],l,m);R[x]=merge(R[x],R[y],m+1,r);return Up(x),x;
	}
	ll qry(int v){return (f[v].w+dist(f[v].l,f[v].r))/2+w[LCA(f[v].l,f[v].r)];}
}
int MIN(int x,int y){return d[x]<d[y]?x:y;}
void dfs3(int x,int La)
{
	for(int i:S[x]) if(i^La) dfs3(i,x),up[x]=MIN(up[x],up[i]),p[x]+=p[i];
	f[x]=En[x]-Bg[x]+1+p[x];w[x]=-f[x];
	for(int i:S[x]) if(i^La) f[x]+=f[i];
	p[x]+=w[x];p[up[x]]-=w[x];
}
void Make1(int x,int La){Sum[x]=Sum[La]+w[x];for(int i:S[x]) if(i^La) Make1(i,x);}
int Rt[N];
void dfs4(int x,int La)
{
	for(int i:S[x]) if(i^La) dfs4(i,x),Rt[x]=Tree::merge(Rt[x],Rt[i]);
	for(int i:Q[x]) Tree::Add(Bg[i],1,Rt[x]);
	for(int i:D[x]) Tree::Add(Bg[i],-2,Rt[x]);
	g[x]=n-(En[x]-Bg[x]+1);
	// cerr<<x<<' '<<Tree::f[Rt[x]].l<<' '<<Tree::f[Rt[x]].r<<'\n';
	g[x]+=Tree::qry(Rt[x])-p[x];
	g[x]-=f[x];
}
void Make2(int x,int La){g[x]+=g[up[x]]+f[up[x]];if(!La) g[x]=0;for(int i:S[x]) if(i^La) Make2(i,x);}
void Solve()
{
	int i,j;scanf("%d",&n);
	for(i=1;i<n;i++)
	{
		int x,y;scanf("%d%d",&x,&y);
		S[x].eb(y);S[y].eb(x);
	}
	int Rt=1;
	dfs1(Rt,0);dfs2(Rt,Rt);
	int m;scanf("%d",&m);
	iota(up+1,up+n+1,1);
	while(m--)
	{
		int x,y;scanf("%d%d",&x,&y);
		int Ls=LCA(x,y);up[x]=MIN(up[x],Ls);up[y]=MIN(up[y],Ls);
		// for(auto i:E) for(int j=i.fi;j<=i.se;j++) A[x][j]++,A[y][j]++,A[Ls][j]-=2;
		// for(auto i:E) Q[x].eb((node){i.fi,i.se,d[Ls]}),Q[y].eb((node){i.fi,i.se,d[Ls]}),D[Ls].eb(i);
		Q[x].eb(x);Q[x].eb(y);Q[y].eb(x);Q[y].eb(y);D[Ls].eb(x);D[Ls].eb(y);
	}
	dfs3(Rt,0);Make1(Rt,0);
	dfs4(Rt,0);Make2(Rt,0);
	for(i=1;i<=n;i++)
	{
		ll ans=g[i];for(int j:S[i]) if(j^fa[i]) ans+=f[j];
		printf("%lld ",ans);
	}
}
int main()
{
	int t=1;
	// scanf("%d",&t);
	while(t--) Solve();
	cerr<<clock()*1.0/CLOCKS_PER_SEC<<'\n';
}