// clang-format off
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define stoi stoll
using pii = pair<int,int>;
using vi = vector<int>;
using vvi = vector<vi>;
#define all(c) begin(c), end(c)
#define rall(c) rbegin(c), rend(c)
#define fore(x, c) for(auto &&x : c)
#define rep(i, a, n) for(int i = a, i##len = (int)(n); i < i##len; ++i)
#define rrep(i, a, n) for(int i = (int)(n - 1); i >= a; --i)
#define sz(c) ((int)c.size())
#define contains(c, x) (c.find(x) != end(c))
#define inseg(l, x, r) ((l) <= (x) && (x) < (r))
#define dump(...)
#define pb push_back
#define eb emplace_back
#define _ 0
const signed INF_ = 1001001001; const long long INF = 1001001001001001001LL;
const int DX[9] = {0,1,0,-1,1,1,-1,-1,0}, DY[9] = {-1,0,1,0,-1,1,1,-1,0};
template<class T> ostream& operator<<(ostream &os, const vector<T> &v) {
  for (auto i = begin(v); i != end(v); i++) os<<*i<<(i==end(v)-1?"":" ");return os;}
template<class T> istream& operator>>(istream &is, vector<T> &v) {
  for (auto i = begin(v); i != end(v); i++) is>>*i;return is;}
template<class T,class U> istream& operator>>(istream &is, pair<T,U> &p) {
  is>>p.first>>p.second;return is;}
template<class T, class U> bool chmax(T &a, const U &b){return a<b?a=b,1:0;}
template<class T, class U> bool chmin(T &a, const U &b){return a>b?a=b,1:0;}
template <class T> void psum(T& c) {partial_sum(begin(c), end(c), begin(c));}
template<class T> using heap = priority_queue<T, deque<T>, greater<T>>;
struct before_main_function {
  before_main_function() {
      cin.tie(nullptr); ios::sync_with_stdio(0);
      cout << setprecision(15) << fixed;
  }
} before_main_function;
// clang-format on
//------------------8<------------------------------------8<--------------------

signed main() {
  int N;
  cin >> N;
  vector<vector<pii>> G(N);
  rep(i, 0, N - 1) {
    int a, b;
    cin >> a >> b;
    a--, b--;
    G[a].eb(b, i);
    G[b].eb(a, i);
  }

  vector<int> depth(N);
  vector<pii> parent(N);
  auto dfs = [&](auto fun, int v, int p, int to_p) -> void {
    parent[v] = {p, to_p};
    for (pii e : G[v]) {
      if (e.first == p) continue;
      depth[e.first] = depth[v] + 1;
      fun(fun, e.first, v, e.second);
    }
  };
  depth[0] = 0;
  dfs(dfs, 0, -1, -1);

  int M;
  cin >> M;
  vector<pii> C(M);
  rep(i, 0, M) {
    int a, b;
    cin >> a >> b;
    a--, b--;
    C[i] = {a, b};
  }

  vector<int> S(M);
  rep(i, 0, M) {
    int u, v;
    tie(u, v) = C[i];
    int du = depth[u], dv = depth[v];
    while (du > dv) {
      S[i] |= 1LL << (parent[u].second);
      u = parent[u].first;
      du--;
    }
    while (du < dv) {
      S[i] |= 1LL << (parent[v].second);
      v = parent[v].first;
      dv--;
    }
    while (u != v) {
      S[i] |= 1LL << (parent[u].second);
      u = parent[u].first;
      S[i] |= 1LL << (parent[v].second);
      v = parent[v].first;
    }
  }

  dump(S[0]);

  int ans = 1LL << (N - 1);
  int neg = 0;
  rep(mask, 1, 1 << M) {
    int cnt = __builtin_popcount(mask);

    int U = 0;
    rep(i, 0, M) {
      if (mask >> i & 1) {
        U |= S[i];
      }
    }
    int free_edge = (N - 1) - __builtin_popcountll(U);
    int tmp = 1LL << free_edge;
    if (cnt % 2) {
      neg += tmp;
    } else {
      neg -= tmp;
    }
  }
  ans -= neg;
  cout << ans << endl;
  return (0 ^ _ ^ 0);
}



Measured memory_bytes: 256