#include <algorithm>
#include <cassert>
#include <cfloat>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <deque>
#include <iostream>
#include <iterator>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>

#define FOR(i,k,n) for(int(i)=(k);(i)<(n);++(i))
#define rep(i,n) FOR(i,0,n)
#define all(v) begin(v),end(v)
#define debug(x) std::cerr<<#x<<": "<<x<<"\n"
#define debug2(x,y) std::cerr<<#x<<": "<<x<<", "<<#y<<": "<<y<<"\n"
#define debug3(x,y,z) std::cerr<<#x<<": "<<x<<", "<<#y<<": "<<y<<", "<<#z<<": "<<z<<"\n"

using ll=long long;
using vi=std::vector<int>;
using vvi=std::vector<vi>;
using vll=std::vector<ll>;
using vvll=std::vector<vll>;
template<typename T> using vvec=std::vector<std::vector<T>>;
template<typename T>
auto make_v(size_t sz){return std::vector<T>(sz);}
template<typename T,typename... Ts>
auto make_v(size_t sz,Ts...ts){return std::vector<decltype(make_v<T>(ts...))>(sz,make_v<T>(ts...));}
template<typename T>
void fill_v(T&var,const T&x){var=x;}
template<typename V,typename T>
void fill_v(V&v,const T&x){for(auto&& w:v){fill_v(w,x);}}

template<typename T> std::ostream& operator<<(std::ostream&s,const std::vector<T>&v){
  int sz=v.size();s<<"\n";rep(i,sz){s<<v[i];if(i<sz-1){s<<"\t";}}s<<"\n";return s;}
template<typename T> std::ostream& operator<<(std::ostream&s,const std::vector<std::vector<T>>&v){
  for(auto&& w:v){s<<w;}return s;}
template<typename T> std::ostream& operator<<(std::ostream&s,const std::deque<T>&v){
  int sz=v.size();s<<"\n";rep(i,sz){s<<v[i];if(i<sz-1){s<<"\t";}}s<<"\n";return s;}
template<typename T> std::ostream& operator<<(std::ostream&s,const std::deque<std::deque<T>>&v){
  for(auto&& w:v){s<<w;}return s;}
template<typename T> std::ostream& operator<<(std::ostream&s, const std::set<T>&v){
  s<<"\n";for(auto&& elm:v){s<<elm<<"\t";}s<<"\n";return s;}

inline void scan(int&a){scanf("%d",&a);}
inline void scan(ll&a){scanf("%lld",&a);}
inline void scan(char&a){scanf(" %c",&a);}
inline void scan(double&a){scanf("%lf",&a);}
template<typename T>
inline void scan(std::vector<T>&v){for(auto&& sv:v){scan(sv);}}
template<typename First,typename...Args>
inline void scan(First&f,Args&...args){scan(f);scan(args...);}
inline void scan(std::string&s){char BUF[3000000];scanf(" %s",BUF);s=std::string(BUF);}
inline void print(int a){printf("%d\n",a);}
inline void print(ll a){printf("%lld\n",a);}
inline void print(double a){printf("%.12f\n",a);}
inline void print(std::string s){std::cout<<s<<"\n";}

using namespace std;

int n;
vvi g;
int root;

int MAX_LOG_V = 40;
vi depth;
vvi par;

void lca_dfs(int u, int prev, int d) {
  depth[u] = d;
  par[u][0] = prev;
  for (int v : g[u]) {
    if (v == prev) {
      continue;
    }
    lca_dfs(v, u, d+1);
  }
}

void lca_init() {
  lca_dfs(root, -1, 0);
  rep (k, MAX_LOG_V - 1) {
    rep (i, n) {
      if (par[i][k] < 0) {
        continue;
      } else {
        par[i][k+1] = par[par[i][k]][k];
      }
    }
  }
}

int lca(int u, int v) {
  if (depth[u] > depth[v]) {
    swap(u, v);
  }
  rep (k, MAX_LOG_V) {
    if ((((depth[v] - depth[u]) >> k) & 1) == 1) {
      v = par[v][k];
    }
  }
  if (u == v) { return u; }
  for (int k = MAX_LOG_V - 1; k >= 0; --k) {
    if (par[u][k] != par[v][k]) {
      u = par[u][k];
      v = par[v][k];
    }
  }
  return par[u][0];
}

unordered_map<ll, int> n2ei;
int hash_n2ei(int a, int b) {
  int mi = min(a, b);
  int ma = max(a, b);
  return mi * 100 + ma;
}
int nodes2edgeidx(int a, int b) {
  int hash = hash_n2ei(a, b);
  return n2ei[hash];
}

void solve() {
  scan(n);
  g.resize(n);
  rep (i, n-1) {
    int a, b;
    scan(a, b);
    --a; --b;
    g[a].push_back(b);
    g[b].push_back(a);
    n2ei[hash_n2ei(a, b)] = i;
  }
  depth.assign(n, 0);
  par.assign(n, vi(MAX_LOG_V, -1));
  lca_init();

  int m;
  scan(m);
  vi edge_coverage(n-1, 0);
  rep (i, m) {
    vi uv(2);
    scan(uv);
    --uv[0]; --uv[1];
    int lcauv = lca(uv[0], uv[1]);
    for (int u : uv) {
      for (int node = u; node != lcauv; node = par[node][0]) {
        int parnode = par[node][0];
        int edgeidx = nodes2edgeidx(node, parnode);
        edge_coverage[edgeidx] |= (1 << i);
      }
    }
  }
  int power2m = (1 << m);
  vll dp(power2m, 0);
  dp[0] = 1;
  rep (i, n-1) {
    vll dp_next = dp;
    rep (j, power2m) {
      int j_next = (j | edge_coverage[i]);
      dp_next[j_next] += dp[j];
    }
    swap(dp, dp_next);
  }
  print(dp[power2m - 1]);
}

int main() {
  solve();
  return 0;
}


Measured memory_bytes: 17272