#define _USE_MATH_DEFINES
#include <algorithm>
#include <cstdio>
#include <functional>
#include <iostream>
#include <cfloat>
#include <climits>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <time.h>
#include <vector>
using namespace std;
 
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> i_i;
typedef pair<ll, int> ll_i;
typedef pair<double, int> d_i;
typedef pair<ll, ll> ll_ll;
typedef pair<double, double> d_d;
// struct edge { int u, v; ll w; };
 
int INF = INT_MAX;
ll MOD = 1000000007;
ll _MOD = 1000000009;
double EPS = 1e-10;
 
int N;
vector<int> G[100010];
int sz[100010], dep[100010];
int M = 1;
int id[100010], par[100010];
int unko[100010], pr[100010];
 
void dfs_sz(int u, int p) {
	sz[u] = 1;
	for (int v: G[u]) {
		if (v == p) continue;
		dfs_sz(v, u);
		sz[u] += sz[v];
	}
}
 
void dfs_dep(int u, int p) {
	for (int v: G[u]) {
		if (v == p) continue;
		dep[v] = dep[u] + 1;
		pr[v] = u;
		dfs_dep(v, u);
	}
}
 
void dfs_hl(int u, int p) {
	int x, ma = 0;
	for (int v: G[u]) {
		if (v == p) continue;
		if (sz[v] > ma) {
			x = v;
			ma = sz[v];
		}
	}
	for (int v: G[u]) {
		if (v == p) continue;
		if (v == x) id[v] = id[u];
		else {
			id[v] = M;
			par[M] = u;
			M++;
		}
		dfs_hl(v, u);
	}
}

void dfs_unko(int u, int p) {
	for (int v: G[u]) {
		if (v == p) continue;
		dfs_unko(v, u);
		unko[u] += unko[v];
	}
}

int main() {
	cin >> N;
	for (int i = 0; i < N - 1; i++) {
		int u, v; scanf("%d%d", &u, &v);
		u--; v--;
		G[u].push_back(v);
		G[v].push_back(u);
	}
	dfs_sz(0, N);
	dep[N] = -1;
	dfs_dep(0, N);
	par[0] = N;
	dfs_hl(0, N);
	int Q; cin >> Q;
	while (Q--) {
		int u, v; scanf("%d%d", &u, &v);
		u--; v--;
		unko[u]++; unko[v]++;
		while (id[u] != id[v]) {
			int U = par[id[u]], V = par[id[v]];
			if (dep[U] > dep[V]) u = U;
			else v = V;
		}
		int x = (dep[u] < dep[v] ? u : v);
		unko[x]--;
		if (x) unko[pr[x]]--;
	}
	dfs_unko(0, N);
	ll ans = 0;
	for (int u = 0; u < N; u++)
		ans += (ll)unko[u] * (unko[u] + 1) / 2;
	cout << ans << endl;
}