/*
 * N
 * u1 v1
 * ..
 * un vn
 * Q : Q people
 * A1 B1
 * ..
 * AQ BQ
 */
#include "stdio.h"

int node[16384][16384];
int a[16384], b[16384], tax[16384];
int taxsum = 0;


void push(u,v) {
    node[u][node[u][0]] = v;
    node[u][0]++;
}

void pay(tax) {
    taxsum += tax;
}

int search(u,v,parent) // @u search v -> returns the #edge between u,v
{
    int ret=1;
    pay(++tax[u]);
    for (int i=1;i<=node[u][0];i++){
        if (parent == node[u][i]) continue;
        else if (node[u][i] == v) return ret;
        else ret += search(node[u][i],v,u);
    }
    pay(-(tax[u]--));
    return 0;
}


int main(int argc, char** argv)
{
    int n,u,v,q;
    scanf("%lld", &n);
    for (int i = 1; i <= n-1; i++)
    {
        scanf("%lld%lld", &u, &v);
        push(u,v);
        push(v,u);
    }
    scanf("%lld", &q);
    for (int i=0; i<q; i++)
    {
        scanf("%lld%lld",&a[i],&b[i]);
        search(a[i],b[i],-1);
    }
    return taxsum;
}