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

#define DEPTH 1024*2-1
#define WIDTH 1024
#define SIZE WIDTH*128
#define PARENT WIDTH-1
#define ROOT 1
int N_nodes;
int N_merchants;
int N_N[SIZE][WIDTH*2];
int tax[SIZE];
int c=0;
long taxsum;
int a[SIZE],b[SIZE];

void push_N_N(u,v){
    N_N[u][++N_N[u][0]]=v;
    N_N[v][++N_N[v][0]]=u;
}
int select_root(){
    int i,r,n,max=0;
    for (i=1;i<=N_nodes;i++)
        if ((n=N_N[i][0])>max){
            max = n;
            r = i;
        }
    return r;
}
void order_nodes(r,parent){
    int i,j,child;
    c++;
    N_N[r][DEPTH]=c;
    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--;
}
void print_radix(){
    int i,j,n;
    for (i=1;i<=N_nodes;i++){
        j=1;
        printf("node %4d 's parent : %4d , named : ",i,N_N[i][PARENT]);
        while((n=N_N[i][PARENT+(j++)])!=0)
            printf("%4d",n);
        printf("\n");
    }
}
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[v]++;
    tax[lca_node]--;
    tax[N_N[lca_node][PARENT]]--;
}
    
int depth(){
    int i,d,depth=0;
    for (i=1;i<=N_nodes;i++){
        if (depth<(d=N_N[i][DEPTH]))
            depth = d;
    }
    return depth;
}

void print_tax(){
    int i;
    for (i=0;i<N_nodes;i++)
        printf("%4d",tax[i+1]);
    printf("\n");
}

void lift_up_sum_imos(){
    int i,d,n;
    for (d=depth();d>1;d--){
        for (i=1;i<=N_nodes;i++){
            if (N_N[i][DEPTH]!=d) continue;
            tax[N_N[i][PARENT]]+=tax[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",&a[i],&b[i]);
        lca_node = lca(a[i],b[i]);
        check_nodes(a[i],b[i],lca_node);
    }
    lift_up_sum_imos();
    for (i=1;i<=N_nodes;i++)
        taxsum+=(tax[i]*(tax[i]+1))/2;
    printf("%ld\n",taxsum);
}