#pragma GCC optimize ("Ofast")
#include<bits/stdc++.h>
using namespace std;
void *wmem;
char memarr[96000000];
template<class T> inline void walloc1d(T **arr, int x, void **mem = &wmem){
  static int skip[16] = {0, 15, 14, 13, 12, 11, 10, 9, 8, 7, 6, 5, 4, 3, 2, 1};
  (*mem) = (void*)( ((char*)(*mem)) + skip[((unsigned long long)(*mem)) & 15] );
  (*arr)=(T*)(*mem);
  (*mem)=((*arr)+x);
}
inline void rd(int &x){
  int k;
  int m=0;
  x=0;
  for(;;){
    k = getchar_unlocked();
    if(k=='-'){
      m=1;
      break;
    }
    if('0'<=k&&k<='9'){
      x=k-'0';
      break;
    }
  }
  for(;;){
    k = getchar_unlocked();
    if(k<'0'||k>'9'){
      break;
    }
    x=x*10+k-'0';
  }
  if(m){
    x=-x;
  }
}
inline void wt_L(char a){
  putchar_unlocked(a);
}
inline void wt_L(long long x){
  int s=0;
  int m=0;
  char f[20];
  if(x<0){
    m=1;
    x=-x;
  }
  while(x){
    f[s++]=x%10;
    x/=10;
  }
  if(!s){
    f[s++]=0;
  }
  if(m){
    putchar_unlocked('-');
  }
  while(s--){
    putchar_unlocked(f[s]+'0');
  }
}
inline int BIT_popcount_L(const int x){
  return __builtin_popcount(x);
}
inline int BIT_popcount_L(const long long x){
  return __builtin_popcountll(x);
}
struct graph{
  int N;
  int *es;
  int **edge;
  void setEdge(int N__, int M, int A[], int B[], void **mem = &wmem){
    int i;
    N = N__;
    walloc1d(&es, N, mem);
    walloc1d(&edge, N, mem);
    for(i=(0);i<(N);i++){
      es[i] = 0;
    }
    for(i=(0);i<(M);i++){
      es[A[i]]++;
      es[B[i]]++;
    }
    for(i=(0);i<(N);i++){
      walloc1d(&edge[i], es[i], mem);
    }
    for(i=(0);i<(N);i++){
      es[i] = 0;
    }
    for(i=(0);i<(M);i++){
      edge[A[i]][es[A[i]]++] = B[i];
      edge[B[i]][es[B[i]]++] = A[i];
    }
  }
}
;
template<class T> struct wgraph{
  int N;
  int *es;
  int **edge;
  T **cost;
  graph g;
  void setEdge(int N__, int M, int A[], int B[], T C[], void **mem = &wmem){
    int i;
    N = N__;
    walloc1d(&es, N, mem);
    for(i=(0);i<(N);i++){
      es[i] = 0;
    }
    for(i=(0);i<(M);i++){
      es[A[i]]++;
      es[B[i]]++;
    }
    walloc1d(&edge, N, mem);
    for(i=(0);i<(N);i++){
      walloc1d(&edge[i], es[i], mem);
    }
    walloc1d(&cost, N, mem);
    for(i=(0);i<(N);i++){
      walloc1d(&cost[i], es[i], mem);
    }
    for(i=(0);i<(N);i++){
      es[i] = 0;
    }
    for(i=(0);i<(M);i++){
      edge[A[i]][es[A[i]]] = B[i];
      edge[B[i]][es[B[i]]] = A[i];
      cost[A[i]][es[A[i]]++] = C[i];
      cost[B[i]][es[B[i]]++] = C[i];
    }
    g.N = N;
    g.es = es;
    g.edge = edge;
  }
  template<class S> void getDistForest(int root, S res[], S unreachable = -1, void *mem = wmem){
    int i;
    int j;
    int k;
    int*q;
    int s;
    int z;
    char *r;
    walloc1d(&q,N,&mem);
    walloc1d(&r,N,&mem);
    for(i=(0);i<(N);i++){
      r[i]=0;
    }
    res[root]=0;
    r[root]=1;
    s=0;
    z=1;
    q[0]=root;
    while(z){
      i=q[s++];
      z--;
      for(j=(0);j<(es[i]);j++){
        k=edge[i][j];
        if(r[k]){
          continue;
        }
        res[k]=res[i]+cost[i][j];
        r[k]=1;
        q[s+z++]=k;
      }
    }
    for(i=(0);i<(N);i++){
      if(!r[i]){
        res[i]=unreachable;
      }
    }
  }
}
;
int N;
int A[50];
int B[50];
int M;
int U[20];
int V[20];
long long ind[50];
wgraph<long long> g;
long long dist[50][50];
long long mask[20];
int len;
int path[51];
int main(){
  int i;
  wmem = memarr;
  long long res = 0;
  long long mk;
  rd(N);
  {
    int Lj4PdHRW;
    for(Lj4PdHRW=(0);Lj4PdHRW<(N-1);Lj4PdHRW++){
      rd(A[Lj4PdHRW]);A[Lj4PdHRW] += (-1);
      rd(B[Lj4PdHRW]);B[Lj4PdHRW] += (-1);
    }
  }
  rd(M);
  {
    int e98WHCEY;
    for(e98WHCEY=(0);e98WHCEY<(M);e98WHCEY++){
      rd(U[e98WHCEY]);U[e98WHCEY] += (-1);
      rd(V[e98WHCEY]);V[e98WHCEY] += (-1);
    }
  }
  for(i=(0);i<(N-1);i++){
    ind[i] = (1LL << i);
  }
  g.setEdge(N,N-1,A,B,ind);
  for(i=(0);i<(N);i++){
    g.getDistForest(i,dist[i]);
  }
  for(i=(0);i<(M);i++){
    mask[i] = dist[U[i]][V[i]];
  }
  for(i=(0);i<(1<<M);i++){
    int j;
    mk = 0;
    for(j=(0);j<(M);j++){
      if(i & 1<<j){
        mk |= mask[j];
      }
    }
    if(BIT_popcount_L(i)%2==0){
      res +=1LL << (N - 1 -BIT_popcount_L(mk));
    }
    else{
      res -=1LL << (N - 1 -BIT_popcount_L(mk));
    }
  }
  wt_L(res);
  wt_L('\n');
  return 0;
}
// cLay varsion 20200214-1

// --- original code ---
// int N, A[50], B[50], M, U[20], V[20];
// ll ind[50];
// 
// wgraph<ll> g;
// ll dist[50][50];
// 
// ll mask[20];
// int len, path[51];
// 
// {
//   ll res = 0, mk;
//   rd(N,(A--,B--)(N-1),M,(U--,V--)(M));
// 
//   rep(i,N-1) ind[i] = (1LL << i);
//   g.setEdge(N,N-1,A,B,ind);
//   rep(i,N) g.getDistForest(i,dist[i]);
//   rep(i,M) mask[i] = dist[U[i]][V[i]];
// 
//   rep(i,1<<M){
//     mk = 0;
//     rep(j,M) if(i & 1<<j) mk |= mask[j];
//     res if[BIT_popcount(i)%2==0,+=,-=] 1LL << (N - 1 - BIT_popcount(mk));
//   }
// 
//   wt(res);
// }


Measured memory_bytes: 256