#include<bits/stdc++.h>
using namespace std;
#define rep(i,a,b) for(int i=a;i<b;i++)



typedef long long ll;
vector<int> E[101010];
class LCA {
public:
	int NV, logNV;
	vector<int> D;
	vector<vector<int> > P;

	void init(int N) {
		NV = N;
		logNV = 0;
		while (NV > (1LL << logNV)) logNV++;
		D = vector<int>(NV);
		P = vector<vector<int> >(logNV, vector<int>(NV));
		dfs(0, -1, 0);
		build();
	}

	void dfs(int v, int par, int d) {
		D[v] = d;
		P[0][v] = par;
		for (int i : E[v]) if (i != par) dfs(i, v, d + 1);
	}

	void build() {
		rep(k, 0, logNV - 1) rep(v, 0, NV) {
			if (P[k][v] < 0)
				P[k + 1][v] = -1;
			else
				P[k + 1][v] = P[k][P[k][v]];
		}
	}

	int query(int u, int v) {
		if (D[u] > D[v]) swap(u, v);
		rep(k, 0, logNV) if ((D[v] - D[u]) >> k & 1) v = P[k][v];
		if (u == v) return u;

		for (int k = logNV - 1; k >= 0; k--) {
			if (P[k][u] != P[k][v]) {
				u = P[k][u];
				v = P[k][v];
			}
		}
		return P[0][u];
	}
};
//-----------------------------------------------------------------
int N;
int Q;
//-----------------------------------------------------------------
LCA lca;
int imos[101010];
ll ans = 0;
ll dfs2(int i) {
	ll ret = imos[i];
	for (int j : E[i]) if (lca.D[i] < lca.D[j]) {
		ret += dfs2(j);
	}
	ans += ret * (ret + 1) / 2;
	return ret;
}
//-----------------------------------------------------------------
int main() {
	scanf("%d", &N);

	rep(i, 0, N - 1) {
		int u, v; scanf("%d %d", &u, &v);
		u--; v--;
		E[u].push_back(v);
		E[v].push_back(u);
	}

	lca.init(N);

	scanf("%d", &Q);

	rep(i, 0, Q) {
		int A, B; scanf("%d %d", &A, &B);
		A--; B--;

		imos[A]++;
		imos[B]++;
		
		int p = lca.query(A, B);
		imos[p]--;

		for (int pp : E[p]) {
			if (lca.D[p] - 1 == lca.D[pp]) imos[pp]--;
		}
	}

	dfs2(0);
	cout << ans << endl;
}