/**
 *   @FileName	a.cpp
 *   @Author	kanpurin
 *   @Created	2020.10.13 18:34:51
**/

#include "bits/stdc++.h" 
using namespace std; 
typedef long long ll;




struct LowestCommonAncestor {
private:
    int n;
    int log;
    vector<vector<int>> parent;
    vector<int> dep;
    vector<vector<int>> G;
    
    void dfs(const vector<vector<int>> &G, int v, int p, int d) {
        parent[0][v] = p;
        dep[v] = d;
        
        for (int to : G[v]) {
            if (to != p) dfs(G, to, v, d + 1);
            
        }
    }
public:
    LowestCommonAncestor(int n) : n(n) {
        G.resize(n);
    }
    void add_edge(int from, int to) {
        G[from].push_back(to);
        G[to].push_back(from);
    }
    
    void build(int root = 0) {
        log = log2(n) + 1;
        parent.resize(log, vector<int>(n));
        dep.resize(n);
        
        dfs(G, root, -1, 0);
        for (int k = 0; k + 1 < log; k++) {
            for (int v = 0; v < G.size(); v++) {
                if (parent[k][v] < 0) {
                    parent[k + 1][v] = -1;
                }
                else {
                    parent[k + 1][v] = parent[k][parent[k][v]];
                }
            }
        }
    }
    int depth(int v) {
        return dep[v];
    }
    
    int lca(int u, int v) {
        if (dep[u] > dep[v]) swap(u, v);
        for (int k = 0; k < log; k++) if ((dep[v] - dep[u]) >> k & 1) v = parent[k][v];
        if (u == v) return u;
        for (int k = log - 1; k >= 0; k--) {
            if (parent[k][u] != parent[k][v]) {
                u = parent[k][u];
                v = parent[k][v];
            }
        }
        return parent[0][u];
    }
    int dist(int u, int v) {
        return dep[u] + dep[v] - 2 * dep[lca(u, v)];
        
    }
};
vector<vector<int>> g;
vector<int> par;
vector<ll> ans;
ll kai;
void parent(int v, int p = -1) {
    par[v] = p;
    for(int u : g[v]) {
        if (u == p) continue;
        parent(u,v);
    }
}
void dfs(int v, int p = -1) {
    for(int u : g[v]) {
        if (u == p) continue;
        dfs(u,v);
        ans[v] += ans[u];
    }
    kai += ans[v] * (ans[v] + 1) / 2;
}
int main() {
    int n;cin >> n;
    g.resize(n);
    par.resize(n,-1);
    ans.resize(n,0);
    LowestCommonAncestor lca(n);
    for (int i = 0; i < n-1; i++) {
        int u,v;cin >> u >> v;
        u--;v--;
        g[u].push_back(v);
        g[v].push_back(u);
        lca.add_edge(u,v);
    }
    parent(0);
    lca.build();
    int q;cin >> q;
    while(q--) {
        int a,b;cin >> a >> b;
        a--;b--;
        int p = lca.lca(a,b);
        ans[a]++;
        ans[b]++;
        ans[p]--;
        if (par[p] != -1) ans[par[p]]--;
    }
    dfs(0);
    cout << kai << endl;
    return 0;
}