#include <bits/stdc++.h>
#define ll long long
#define INF 1000000005
#define MOD 1000000007
#define EPS 1e-10
#define rep(i,n) for(int i=0;i<(int)n;++i)
#define each(a,b) for(auto (a): (b))
#define all(v) (v).begin(),(v).end()
#define zip(v) sort(all(v)),v.erase(unique(all(v)),v.end())
#define fi first
#define se second
#define pb push_back
#define show(x) cout<<#x<<" = "<<(x)<<endl
#define spair(p) cout<<#p<<": "<<p.fi<<" "<<p.se<<endl
#define svec(v) cout<<#v<<":";rep(kbrni,v.size())cout<<" "<<v[kbrni];cout<<endl
#define sset(s) cout<<#s<<":";each(kbrni,s)cout<<" "<<kbrni;cout<<endl
#define smap(m) cout<<#m<<":";each(kbrni,m)cout<<" {"<<kbrni.first<<":"<<kbrni.second<<"}";cout<<endl

using namespace std;

typedef pair<int,int>P;

const int MAX_N = 100005;

int imos[MAX_N],par[MAX_N];
int depth[MAX_N],id[MAX_N];
vector<int> ord;
vector<int> G[MAX_N];

template<typename V> class segtree {
private:
    int n,sz; vector<V> node; vector<int> node_id;
public:
    void resize(vector<V> v){
        sz = (int)v.size(); n = 1;
        while(n < sz) n *= 2;
        node.resize(2*n-1),node_id.resize(2*n-1);
        rep(i,sz){
            node[i+n-1] = v[i];
            node_id[i+n-1] = i;
        }
        for(int i=n-2; i>=0; i--){
            if(node[2*i+1] > node[2*i+2]){
                node[i] = node[2*i+2];
                node_id[i] = node_id[2*i+2];
            }else{
                node[i] = node[2*i+1];
                node_id[i] = node_id[2*i+1];
            }
        }
    }
    void update(int k,int a)
    {
    	k += n-1;
    	node[k] = a,node_id[k] = k-(n-1);
    	while(k>0){
    		k = (k-1)/2;
    		if(node[2*k+1] < node[2*k+2]){
                node[k] = node[2*k+1],node_id[k] = node_id[2*k+1];
            }else{
                node[k] = node[2*k+2],node_id[k] = node_id[2*k+2];
            }
    	}
    }
    pair<V,int> query(int a,int b,int k=0,int l=0,int r=-1)
    {
        if(r < 0) r = n;
    	if(r <= a || b <= l) return pair<V,int>(INT_MAX,-1);
    	if(a <= l && r <= b){
    		return pair<V,int>(node[k],node_id[k]);
    	}else{
    		pair<V,int> vl = query(a,b,2*k+1,l,(l+r)/2);
    		pair<V,int> vr = query(a,b,2*k+2,(l+r)/2,r);
    		return min(vl,vr);
    	}
    }
    void print()
    {
        rep(i,sz){
            pair<V,int> p;
            p = query(i,i+1);
            cout << "st[" << i << "]: " << p.fi << " " << p.se << endl;
        }
    }
};

void dfs(int u,int p,int k)
{
    id[u] = (int)ord.size();
    ord.pb(u);
    depth[u] = k;
    par[u] = p;
    rep(i,G[u].size()){
        if(G[u][i] != p){
            dfs(G[u][i],u,k+1);
            ord.pb(u);
        }
    }
}

segtree<int> st;

void lca_make(){
	dfs(0,-1,0);
    vector<int> stvec((int)ord.size());
	rep(i,ord.size()){
		stvec[i] = depth[ord[i]];
	}
    st.resize(stvec);
}

int lca(int u,int v){
	return ord[st.query(min(id[u],id[v]),max(id[u],id[v])+1).se];
}

void solve(int u,int p,ll& ans)
{
    rep(i,G[u].size()){
        if(G[u][i] != p){
            solve(G[u][i],u,ans);
            imos[u] += imos[G[u][i]];
        }
    }
    ans += (ll)imos[u]*(imos[u]+1)/2;
}

int main()
{
    cin.tie(0);
    ios::sync_with_stdio(false);
    int n;
    cin >> n;
    rep(i,n-1){
        int a,b;
        cin >> a >> b;
        G[a-1].pb(b-1),G[b-1].pb(a-1);
    }
    lca_make();
    int q;
    cin >> q;
    rep(i,q){
        int a,b;
        cin >> a >> b;
        a--,b--;
        int res = lca(a,b);
        imos[a]++,imos[b]++;
        imos[res]--;
        if(par[res] >= 0){
            imos[par[res]]--;
        }
    }
    ll ans = 0;
    solve(0,-1,ans);
    cout << ans << endl;
    return 0;
}