// what is matter? never mind. 
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
//#pragma GCC target("sse,sse2,sse3,sse4,popcnt,abm,mmx,avx,avx2") 
#include<bits/stdc++.h>
#define For(i,a,b) for(int i=(a);i<=(b);++i)
#define Rep(i,a,b) for(int i=(a);i>=(b);--i)
#define ll long long
#define ull unsigned long long
#define int long long
using namespace std;
inline int read()
{
    char c=getchar();int x=0;bool f=0;
    for(;!isdigit(c);c=getchar())f^=!(c^45);
    for(;isdigit(c);c=getchar())x=(x<<1)+(x<<3)+(c^48);
    if(f)x=-x;return x;
}

#define fi first
#define se second
#define pb push_back
#define mkp make_pair
typedef pair<int,int>pii;
typedef vector<int>vi;
 
#define maxn 200005
#define inf 0x3f3f3f3f

bool mbe;
int n,m;
vi e[maxn];

int fa[maxn],son[maxn],sz[maxn],dep[maxn];
int dfn[maxn],out[maxn],top[maxn],que[maxn],idx;
void dfs1(int u){
	sz[u]=1;
	for(auto v:e[u]){
		if(v==fa[u])continue;
		fa[v]=u,dep[v]=dep[u]+1,dfs1(v),sz[u]+=sz[v];
		if(sz[v]>sz[son[u]])son[u]=v; 
	}
}
void dfs2(int u,int tp){
	top[u]=tp,dfn[u]=++idx,que[idx]=u;
	if(son[u])dfs2(son[u],tp);
	for(auto v:e[u])if(v!=fa[u]&&v!=son[u])dfs2(v,v);
	out[u]=idx;
}
int kth(int u,int k){
	while(k>=dfn[u]-dfn[top[u]]+1&&dfn[u]!=1)
		k-=dfn[u]-dfn[top[u]]+1,u=fa[top[u]];
	return que[dfn[u]-k];
}
int jump(int u,int v){
	for(;top[u]!=top[v];u=fa[top[u]])
		if(fa[top[u]]==v)return top[u];
	return son[v];
}

int st[20][maxn],lg[maxn];
int dfnmin(int u,int v){
	return dep[u]<dep[v]?u:v;
}
void init(){
	//For(i,1,n)cout<<que[i]<<" "; cout<<"\n";
	For(i,2,n)st[0][i]=fa[que[i]],lg[i]=lg[i>>1]+1;
	For(j,1,19)
		For(i,1,n-(1<<j)+1)
			st[j][i]=dfnmin(st[j-1][i],st[j-1][i+(1<<(j-1))]);
}
int lca(int u,int v){
	if(!u||!v)return 0;
	if(u==v)return u;
	if((u=dfn[u])>(v=dfn[v]))swap(u,v); ++u;
	int k=lg[v-u+1];
	return dfnmin(st[k][u],st[k][v-(1<<k)+1]);
}

int eu[maxn],ev[maxn],elca[maxn];
int mn[maxn];
vector<int>del[maxn];

int f[maxn],dw[maxn];
// f[u] : fa[u] to subtree(u)
void dfs3(int u){
	for(int v:e[u]){
		if(v==fa[u])continue;
		dfs3(v);
		dw[u]+=dw[v];
	}
	if(u==1)return;
	for(int x:del[u]){
		for(int y:e[x])if(y!=fa[x])dw[u]-=f[y];
		dw[u]+=f[x];
	}
	f[u]=dw[u]+sz[u];
}

int dis[maxn],wei[maxn];
struct dat{
	int l,r,v;
	dat(int x=0,int y=0,int zz=0){l=x,r=y,v=zz;}
};
dat operator +(dat a,dat b){
	dat c;
	c.l=a.l?a.l:b.l;
	c.r=b.r?b.r:a.r;
	int up=lca(que[a.r],que[b.l]);
	c.v=a.v+b.v-dis[up];
	return c;
}

int sum[maxn];
int qsub(int u){
	return sum[out[u]]-sum[dfn[u]];
}

#define N maxn*80
int rt[maxn],ls[N],rs[N],tot;
dat val[N];
void up(int p){
	val[p]=val[ls[p]]+val[rs[p]];
}
void mdf(int&p,int l,int r,int x,int y){
	if(!p)p=++tot;
	if(l==r){
		val[p]=dat(l,l,dis[que[l]]);
		return;
	}
	int mid=l+r>>1;
	if(x<=mid)mdf(ls[p],l,mid,x,y);
	else mdf(rs[p],mid+1,r,x,y); up(p);
}
int merge(int u,int v,int l,int r){
	if(!u||!v)return u|v;
	if(l==r)return u;
	int p=++tot;
	int mid=l+r>>1;
	return ls[p]=merge(ls[u],ls[v],l,mid),rs[p]=merge(rs[u],rs[v],mid+1,r),up(p),p;
}
dat ask(int p,int l,int r,int ql,int qr){
	if(!p||ql>qr)return dat(0,0,0);
	if(l>=ql&&r<=qr)return val[p];
	int mid=l+r>>1; dat res=dat(0,0,0);
	if(ql<=mid)res=ask(ls[p],l,mid,ql,qr);
	if(qr>mid)res=res+ask(rs[p],mid+1,r,ql,qr);
	return res;
}

int g[maxn];
void dfs4(int u){
	if(u!=1){
		dat res=(ask(rt[u],1,n,1,dfn[u]-1)+(dat(dfn[u],dfn[u],dis[u]))+ask(rt[u],1,n,out[u]+1,n));
	//	cout<<"res "<<u<<" "<<que[res.l]<<" "<<que[res.r]<<" "<<res.v<<"\n";
		int up=lca(que[res.l],que[res.r]);
		g[u]=g[up];
		g[u]+=qsub(up)-qsub(u)-(res.v-dis[up]);
		g[u]+=n-sz[u];
	}
//	cout<<"G "<<u<<" "<<g[u]<<"\n";
	for(int v:e[u]) if(v!=fa[u]) dfs4(v);
}

bool med;

signed main()
{
	cerr<<(1.0*(&mbe-&med)/1024576.0)<<"\n";
	n=read();
	For(i,2,n){
		int u=read(),v=read();
		e[u].pb(v),e[v].pb(u);
	}
	dep[1]=1,dfs1(1),dfs2(1,1),init();
	
	For(i,1,n)mn[i]=dep[i];
	m=read();
	For(i,1,m){
		eu[i]=read(),ev[i]=read();
		elca[i]=lca(eu[i],ev[i]);
		mn[eu[i]]=min(mn[eu[i]],dep[elca[i]]);
		mn[ev[i]]=min(mn[ev[i]],dep[elca[i]]);
	}
	Rep(i,n,2){
		int u=que[i];
		mn[fa[u]]=min(mn[fa[u]],mn[u]);
	}
	Rep(i,n,1){
		int u=que[i];
		int v=kth(u,dep[u]-mn[u]);
//		cout<<"del "<<u<<" "<<v<<"\n";
		del[v].pb(u);
	}
	dfs3(1);
//	For(u,1,n)cout<<f[u]<<" ";cout<<"\n";
	For(u,2,n){
		wei[u]=f[u];
		for(int v:e[u])if(v!=fa[u])wei[u]-=f[v];
	}
//	For(i,1,n)cout<<wei[i]<<" "; cout<<" wei\n";
	For(i,1,n) sum[i]=sum[i-1]+wei[que[i]];
	For(i,2,n){
		int u=que[i];
		dis[u]=dis[fa[u]]+wei[u];
	}
	For(i,1,m){
		int u=eu[i],v=ev[i];
		mdf(rt[u],1,n,dfn[v],1);
		mdf(rt[v],1,n,dfn[u],1);
	}
	Rep(i,n,2){
		int u=que[i];
		rt[fa[u]]=merge(rt[fa[u]],rt[u],1,n);
	}
	dfs4(1);
	For(u,1,n){
		int res=g[u];
		for(int v:e[u]) if(v!=fa[u]) res+=f[v];
		cout<<res<<' ';
	}
    return 0;
}
/*
6
1 2
5 4
6 5
3 1
1 5
3
6 1
2 3
6 4
*/