#include<stdio.h>
#include<stdlib.h>

#define WIDTH  1000
#define SIZE   WIDTH*101
#define PARENT WIDTH-1
#define ROOT   1

int N_nodes;
int N_merchants;
int N_N[SIZE][WIDTH*2];
int c;
long tax[SIZE];
long maxdepth,taxsum;
int dep[WIDTH][SIZE];

void push_N_N(u,v){
    N_N[u][++N_N[u][0]]=v;
    N_N[v][++N_N[v][0]]=u;
}
void order_nodes(r,parent){
    int i,j,child;
    c++;
    if(maxdepth<c) maxdepth=c;
    dep[c][++dep[c][0]]=r;
    N_N[r][PARENT]=parent;
    for (i=1;i<=N_N[r][0];i++){
        child = N_N[r][i];
        if (child == parent ) continue;
        N_N[child][PARENT+(c+1)]=i;
        for (j=1;j<c+1;j++)
            N_N[child][PARENT+j]=N_N[r][PARENT+j];
        order_nodes(child,r);
    }
    c--;
}
int lca(u,v){
    int i=1,uu=u,vv=v;
    while(N_N[u][PARENT+i]==N_N[v][PARENT+i]) i++;
    while(N_N[u][PARENT+i]!=0){
        uu=N_N[uu][PARENT];
        i++;
    }
    return uu;
}
void check_nodes(u,v,lca_node){
    tax[u]++;tax[lca_node]--;
    tax[v]++;tax[N_N[lca_node][PARENT]]--;
}
void lift_up_sum_imos(){
    int i,d;
    for (d=maxdepth;d>1;d--)
        for (i=1;i<=dep[d][0];i++)
            tax[N_N[dep[d][i]][PARENT]]+=tax[dep[d][i]];
}


int main(){
    int i,j,k, u,v,mer,lca_node;
    scanf("%d",&N_nodes);
    for (i=1;i<N_nodes;i++){
        scanf("%d %d",&u,&v);
        push_N_N(u,v);
    }
    N_N[ROOT][PARENT+1]=1;
    order_nodes(ROOT,SIZE-1);
    scanf("%d", &N_merchants);
    for (i=1;i<=N_merchants;i++){
        scanf("%d %d",&u,&v);
        lca_node = lca(u,v);
        check_nodes(u,v,lca_node);
    }
    lift_up_sum_imos();
    for (i=1;i<=N_nodes;i++)
        taxsum += (tax[i]*(tax[i]+1))/2;
    printf("%ld\n",taxsum);
}