// #pragma GCC target("avx2") #pragma GCC optimize("O3") #pragma GCC optimize("unroll-loops") #include #include // #include using namespace std; using namespace atcoder; using mint = modint998244353; // using mint = modint1000000007; // using namespace boost::multiprecision; using uint = unsigned int; using ll = long long; using ull = unsigned long long; using ld = long double; using pii = pair; using pll = pair; using T3 = tuple; using G = vector>; #define rep(i, n) for (ll i = 0; i < (n); ++i) #define rep2(i, a, b) for (ll i = a; i < (b); ++i) #define rrep2(i, a, b) for (ll i = a-1; i >= (b); --i) #define rep3(i, a, b, c) for (ll i = a; i < (b); i+=c) #define rng(a) a.begin(),a.end() #define rrng(a) a.rbegin(),a.rend() #define popcount __builtin_popcount #define popcount_ll __builtin_popcountll #define fi first #define se second #define UNIQUE(v) sort(rng(v)), v.erase(unique(rng(v)), v.end()) #define MIN(v) *min_element(rng(v)) #define MAX(v) *max_element(rng(v)) #define SUM(v) accumulate(rng(v),0LL) #define IN(v, x) (find(rng(v),x) != v.end()) template bool chmin(T &a,T b){if(a>b){a=b;return 1;}else return 0;} template bool chmax(T &a,T b){if(a void printv(vector &v){rep(i,v.size())cout< void printvv(vector> &v){rep(i,v.size())rep(j,v[i].size())cout< dist(0, INF); return dist(mt);} struct HLD { vector> g; vector pos, head, sub, par, inv; HLD(int n): g(n), pos(n,-1), head(n), sub(n,1), par(n,-1), inv(n) {} void add_edge(int u,int v) { g[u].emplace_back(v); g[v].emplace_back(u); } void dfs(int v) { auto &es = g[v]; if(par[v] != -1) es.erase(find(rng(es), par[v])); for(int &u : es){ par[u]=v; dfs(u); sub[v]+=sub[u]; if(sub[u] > sub[es[0]]) swap(u, es[0]); } } void decompose(int v, int &i) { pos[v] = i++; inv[pos[v]] = v; for(int u: g[v]){ if(u == par[v]) continue; head[u] = (u == g[v][0] ? head[v] : u); decompose(u, i); } } void build(int root=0) { int pos = 0; dfs(root); head[root] = root; decompose(root, pos); } int lca(int u,int v) { while(1){ if(pos[u] > pos[v]) swap(u, v); if(head[u] == head[v]) return u; v = par[head[v]]; } } template void for_each(int u, int v, const F& f) { while(1){ if(pos[u] > pos[v]) swap(u, v); f(max(pos[head[v]], pos[u]), pos[v]+1); if(head[u] != head[v]) v = par[head[v]]; else break; } } template void for_each_edge(int u, int v, const F& f) { while(1){ if(pos[u] > pos[v]) swap(u, v); if(head[u] != head[v]){ f(pos[head[v]], pos[v]+1); v = par[head[v]]; }else{ if(u != v) f(pos[u]+1, pos[v]+1); break; } } } }; pll op(pll a, pll b){return {a.fi+b.fi, a.se+b.se};} pll e(){return {0, 0};} pll mapping(ll f, pll x){return {f*x.se+x.fi, x.se};} ll composition(ll f, ll g){return f+g;} ll id(){return 0;} int main(){ ios::sync_with_stdio(false); cin.tie(nullptr); int n; cin >> n; HLD g(n); rep(i, n-1){ int u, v; cin >> u >> v; u--, v--; g.add_edge(u, v); } g.build(); lazy_segtree seg(n); rep(i, n) seg.set(i, {0, 1}); int q; cin >> q; ll ans = 0; rep(qi, q){ int u, v; cin >> u >> v; u--, v--; g.for_each(u, v, [&](int l, int r){ seg.apply(l, r, 1); ans += seg.prod(l, r).fi; }); } cout << ans << endl; return 0; }