#include <bits/stdc++.h>
using namespace std;
using i64 = int64_t;

struct HeavyLightDecomposition {
    vector<int> sz, par, depth;
    vector<int> idx, revidx, hld, top;
    vector<vector<int>> G;
    int root;
    bool is_built = false;

    HeavyLightDecomposition(int n, int root = 0)
        : sz(n), par(n), depth(n), idx(n), revidx(n), top(n), G(n), root(root) {}

    void add_edge(int u, int v) {
        G[u].push_back(v);
        G[v].push_back(u);
    }

    void build() {
        dfs(root);
        dfs2(root);
        is_built = true;
    }

    void dfs(int v, int p = -1) {
        sz[v] = 1;
        par[v] = p;
        if (p >= 0) depth[v] = depth[p] + 1;
        for (int &to : G[v]) {
            if (to == p) continue;
            dfs(to, v);
            sz[v] += sz[to];
        }
    }

    void dfs2(int v, int p = -1) {
        idx[v] = hld.size();
        revidx[hld.size()] = v;
        hld.push_back(v);

        int x = 0;
        int heaviest = -1;
        for (int &to : G[v]) {
            if (to == p) continue;
            if (x < sz[to]) {
                x = sz[to];
                heaviest = to;
            }
        }

        if (heaviest < 0) return;

        top[heaviest] = top[v];
        dfs2(heaviest, v);
        for (int &to : G[v]) {
            if (to == heaviest || to == p) continue;
            top[to] = to;
            dfs2(to, v);
        }
    }

    // return [l, r)s
    vector<pair<int, int>> query(int u, int v) {
        assert(is_built);
        vector<pair<int, int>> ret;
        while (top[u] != top[v]) {
            if (depth[top[u]] > depth[top[v]]) swap(u, v);
            ret.push_back({idx[top[v]], idx[v] + 1});
            v = par[top[v]];
        }
        if (idx[u] > idx[v]) swap(u, v);
        ret.push_back({idx[u], idx[v] + 1});
        return ret;
    }

    i64 lca(int u, int v) {
        assert(is_built);
        while (top[u] != top[v]) {
            if (depth[top[u]] > depth[top[v]]) swap(u, v);
            v = par[top[v]];
        }
        if (idx[u] > idx[v]) swap(u, v);
        return u;
    }
};

void solve() {
    int n;
    cin >> n;
    HeavyLightDecomposition hld(n);
    for (int i = 0; i < n - 1; i++) {
        int a, b;
        cin >> a >> b;
        a--;
        b--;
        hld.add_edge(a, b);
    }
    hld.build();

    int q;
    cin >> q;
    vector<i64> dp(n + 1);
    while (q--) {
        int a, b;
        cin >> a >> b;
        a--;
        b--;
        auto segments = hld.query(a, b);
        for (auto &[l, r] : segments) {
            dp[l]++;
            dp[r]--;
        }
    }

    for (int i = 0; i < n; i++) {
        dp[i + 1] += dp[i];
    }

    i64 ans = 0;
    for (int i = 0; i < n; i++) {
        ans += dp[i] * (dp[i] + 1) / 2;
    }
    cout << ans << endl;
}

int main() {
    cin.tie(0);
    ios::sync_with_stdio(false);
    solve();
    return 0;
}