# include <bits/stdc++.h>
using namespace std;
typedef long long ll; 
//# define int long long
# define lc u << 1
# define rc u << 1 | 1
# define fi first
# define se second
const int N = 100005;

int n;
vector<int> E[N];
int P[21][N],D[N];
ll tot[N];
ll ret;

void dfs(int cur) {
	for (auto it : E[cur])
	if(it!=P[0][cur]) D[it]=D[cur]+1, P[0][it]=cur, dfs(it);
}
int getlca(int a,int b) {
	int ret=0,i,aa=a,bb=b;
	if(D[aa]>D[bb]) swap(aa,bb);
	for(i=19;i>=0;i--) if(D[bb]-D[aa]>=1<<i) bb=P[i][bb];
	for(i=19;i>=0;i--) if(P[i][aa]!=P[i][bb]) aa=P[i][aa], bb=P[i][bb];
	return (aa==bb)?aa:P[0][aa];               // vertex
}

void dfs2(int cur,int pre) {
	
	for (auto e : E[cur]) if(e!=pre) dfs2(e,cur);
	if(pre>=1) tot[pre] += tot[cur];
	ret += tot[cur]*(tot[cur]+1)/2;
}
signed main ()
{
//	freopen ("tax.in", "r", stdin); freopen ("tax.out", "w", stdout);
	int i,j,k,l,r,x,y; string s;
	
	cin>>n;
	for (int i = 1; i < n; i ++ )
	{
		cin>>x>>y;
		E[x].push_back(y);
		E[y].push_back(x);
	}
	dfs(1);
	for (int i = 0; i < 19; i ++ )
		for (int x = 1; x <= n; x ++ )
			P[i+1][x]=P[i][P[i][x]];
	
	cin>>i;
	while(i--) {
		cin>>x>>y;
		int lca=getlca(x,y);
		tot[x]++;
		tot[y]++;
		tot[lca]--;
		if(lca!=1) tot[P[0][lca]]--;
	}
	dfs2(1,0);
	cout<<ret<<endl;
	
}