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




typedef long long ll;
struct LazySegTreeAddSetSum { // 全部[l,r]

    struct Data {
        ll val, add, sum; bool valset;
        ll calc_sum(int l, int r) { if (valset) return (val + add) * (r - l + 1); else return sum + add * (r - l + 1); }
        void set_data(int x, int y) { val = x; add = 0; valset = true; }
        Data() :val(0), add(0), sum(0), valset(false) {}
    };

    vector<Data> data; int seg_size;

    LazySegTreeAddSetSum(int n) {
        for (seg_size = 1; seg_size < n; seg_size *= 2);
        data.assign(seg_size * 2, Data());
    }

    ll set(int a, int b, ll x, int l = 0, int r = -1, int k = 0) {
        if (r == -1) r = seg_size - 1;

        if (a <= l && r <= b) { data[k].set_data(x, 0); return data[k].calc_sum(l, r); }
        if (r < a || b < l) return data[k].calc_sum(l, r);

        if (data[k].valset) {
            data[k * 2 + 1].set_data(data[k].val, data[k].add);
            data[k * 2 + 2].set_data(data[k].val, data[k].add);
        }

        data[k].add = 0; data[k].valset = false;
        data[k].sum = set(a, b, x, l, (l + r) / 2, k * 2 + 1) + set(a, b, x, (l + r) / 2 + 1, r, k * 2 + 2);
        return data[k].calc_sum(l, r);
    }

    ll add(int a, int b, ll x, int l = 0, int r = -1, int k = 0) {
        if (r == -1) r = seg_size - 1;
        if (a <= l && r <= b) { data[k].add += x; return data[k].calc_sum(l, r); }
        if (r < a || b < l) return 0;

        if (data[k].valset) {
            data[k * 2 + 1].set_data(data[k].val, 0);
            data[k * 2 + 2].set_data(data[k].val, 0);
            data[k].valset = false;
        }

        data[k].sum = add(a, b, x, l, (l + r) / 2, k * 2 + 1) + add(a, b, x, (l + r) / 2 + 1, r, k * 2 + 2);
        return data[k].calc_sum(l, r);
    }

    ll query(int a, int b, int l = 0, int r = -1, int k = 0) {
        if (r == -1) r = seg_size - 1;
        if (r < a || b < l) return 0;
        if ((a <= l && r <= b) || data[k].valset) return data[k].calc_sum(max(a, l), min(b, r));
        return query(a, b, l, (l + r) / 2, k * 2 + 1) + query(a, b, (l + r) / 2 + 1, r, k * 2 + 2) +
            data[k].add * (min(b, r) - max(a, l) + 1);
    }

};
//-----------------------------------------------------------------------------------
const int NV = 1e5;

vector<int> g[NV];

int dep[NV];
int head[NV];
int par[NV];
int hev[NV];
int vid[NV];
int L[NV];
int R[NV];
int timer;

int dfs(int u, int p = -1) {
    hev[u] = -1;
    int ret = 1;
    int maxsub = 0;
    for (int v : g[u]) if(v != p){
        dep[v] = dep[u] + 1;
        int s = dfs(v, u);
        ret += s;
        if (maxsub < s) {
            maxsub = s;
            hev[u] = v;
        }
    }
    return ret;
}

void dfs2(int u, int h, int p = -1) {
    L[u] = timer;
    vid[u] = timer++;
    head[u] = h;
    if (hev[u] != -1) {
        dfs2(hev[u], h, u);
    }
    for (int v : g[u]) if (v != hev[u]) if(v != p) {
        dfs2(v, v, u);
    }
    R[u] = timer;
}

void hlbuild() {
    dfs(0);
    dfs2(0, 0);
}

void foreach(int u, int v, function<void(int, int)> f) {
    while (true) {
        if (head[u] == head[v]) {
            if (vid[u] > vid[v]) swap(u, v);
            f(vid[u], vid[v]);
            break;
        }
        else {
            if (dep[head[u]] > dep[head[v]]) swap(u, v);
            f(vid[head[v]], vid[v]);
            v = par[head[v]];
        }
    }
}
//-----------------------------------------------------------------------------------
int N;
//-----------------------------------------------------------------------------------
int main() {
    cin >> N;
    rep(i, 0, N - 1) {
        int a, b; scanf("%d%d", &a, &b); a--; b--;
        g[a].push_back(b);
        g[b].push_back(a);
    }

    hlbuild();

    LazySegTreeAddSetSum st(N);
    st.add(0, N - 1, 1);

    int Q; cin >> Q;
    ll ans = 0;
    rep(q, 0, Q) {
        int a, b; scanf("%d%d", &a, &b); a--; b--;
        foreach(a, b, [&](int u, int v) {
            ans += st.query(u, v);
            st.add(u, v, 1);
        });
    }
    cout << ans << endl;
}