#include <bits/stdc++.h>

#define rep(i, n) for (int i = 0; i < int(n); i++)
#define rrep(i, n) for (int i = int(n) - 1; i >= 0; i--)
#define reps(i, n) for (int i = 1; i <= int(n); i++)
#define rreps(i, n) for (int i = int(n); i >= 1; i--)
#define repc(i, n) for (int i = 0; i <= int(n); i++)
#define rrepc(i, n) for (int i = int(n); i >= 0; i--)
#define repi(i, a, b) for (int i = int(a); i < int(b); i++)
#define repic(i, a, b) for (int i = int(a); i <= int(b); i++)
#define each(x, y) for (auto &x : y)
#define all(a) (a).begin(), (a).end()
#define bit(b) (1ll << (b))

using namespace std;

using i32 = int;
using i64 = long long;
using u64 = unsigned long long;
using f80 = long double;
using vi32 = vector<i32>;
using vi64 = vector<i64>;
using vu64 = vector<u64>;
using vf80 = vector<f80>;
using vstr = vector<string>;

inline void yes() { cout << "Yes" << '\n'; exit(0); }
inline void no() { cout << "No" << '\n'; exit(0); }
inline i64 gcd(i64 a, i64 b) { if (min(a, b) == 0) return max(a, b); if (a % b == 0) return b; return gcd(b, a % b); }
inline i64 lcm(i64 a, i64 b) { return a / gcd(a, b) * b; }
inline u64 xorshift() { static u64 x = 88172645463325252ull; x = x ^ (x << 7); return x = x ^ (x >> 9); }
template <typename T> class pqasc : public priority_queue<T, vector<T>, greater<T>> {};
template <typename T> class pqdesc : public priority_queue<T, vector<T>, less<T>> {};
template <typename T> inline void amax(T &x, T y) { if (x < y) x = y; }
template <typename T> inline void amin(T &x, T y) { if (x > y) x = y; }
template <typename T> inline T exp(T x, i64 n, T e = 1) { T r = e; while (n > 0) { if (n & 1) r *= x; x *= x; n >>= 1; } return r; }
template <typename T> inline T bis(T ok, T ng, function<bool(T)> f, T eps = 1) { while (abs(ok - ng) > eps) { T mi = (ok + ng) / 2; (f(mi) ? ok : ng) = mi; } return ok; }
template <typename T> istream& operator>>(istream &is, vector<T> &v) { each(x, v) is >> x; return is; }
template <typename T> ostream& operator<<(ostream &os, vector<T> &v) { rep(i, v.size()) { if (i) os << ' '; os << v[i]; } return os; }
template <typename T, typename S> istream& operator>>(istream &is, pair<T, S> &p) { is >> p.first >> p.second; return is; }
template <typename T, typename S> ostream& operator<<(ostream &os, pair<T, S> &p) { os << p.first << ' ' << p.second; return os; }
void solve(); int main() { ios::sync_with_stdio(0); cin.tie(0); cout << fixed << setprecision(16); solve(); return 0; }

template <typename T>
void fwt(vector<T>& f) {
  int n = f.size();
  for (int i = 1; i < n; i <<= 1) {
    for (int j = 0; j < n; j++) {
      if ((j & i) == 0) {
        f[j | i] += f[j];
      }
    }
  }
}
template <typename T>
void ifwt(vector<T>& f) {
  int n = f.size();
  for (int i = 1; i < n; i <<= 1) {
    for (int j = 0; j < n; j++) {
      if ((j & i) == 0) {
        f[j | i] -= f[j];
      }
    }
  }
}

void solve() {
  int n;
  cin >> n;
  vector<vector<pair<int, int>>> edges(n);
  rep(i, n - 1) {
    int a, b;
    cin >> a >> b;
    a--, b--;
    edges[a].emplace_back(b, i);
    edges[b].emplace_back(a, i);
  }
  vector<vi32> dist(n, vi32(n));
  function<void(int, int, int, int)> dfs = [&](int x, int u, int p, int d) {
    dist[x][u] = d;
    each(pa, edges[u]) {
      int v, i;
      tie(v, i) = pa;
      if (v == p) continue;
      dfs(x, v, u, d + 1);
    }
  };
  rep(i, n) {
    dfs(i, i, -1, 0);
  }
  map<int, vi32> ma;
  function<void(int, int, int, int, int)> dfs2 = [&](int x, int y, int u, int p, int i) {
    each(pa, edges[u]) {
      int v, ii;
      tie(v, ii) = pa;
      if (v == p) continue;
      if (dist[x][v] + dist[v][y] == dist[x][y]) {
        ma[ii].push_back(i);
        dfs2(x, y, v, u, i);
      }
    }
  };
  int m;
  cin >> m;
  rep(i, m) {
    int u, v;
    cin >> u >> v;
    u--, v--;
    dfs2(u, v, u, -1, i);
  }
  map<int, int> mask;
  each(p, ma) {
    int x = 0;
    each(v, p.second) x |= 1 << v;
    mask[p.first] = x;
  }
  int M = 1 << m;
  function<vi64(int, int)> dp = [&](int u, int p) {
    vi64 ret(M);
    ret[0] = 1;
    each(pa, edges[u]) {
      int v, e;
      tie(v, e) = pa;
      if (v == p) continue;
      auto tmp = dp(v, u);
      vi64 sum(M);
      for (int i = 0; i < M; i++) {
        sum[i] += tmp[i];
        sum[i | mask[e]] += tmp[i];
      }
      auto tem = ret;
      fwt(sum);
      fwt(ret);
      rep(i, M) ret[i] *= sum[i];
      ifwt(ret);
    }
    return ret;
  };
  cout << dp(0, -1)[M - 1] << endl;
}


Measured memory_bytes: 426496