#include <algorithm>
#include <bitset>
#include <cmath>
#include <complex>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <regex>
#include <set>
#include <stack>
#include <string>
#include <vector>

const int MOD = 1e9 + 7;
const int iINF = 2147483647 / 2;
const long long int llINF = 9223372036854775807 / 2;

using namespace std;
using ll = long long int;
using vl = vector<ll>;
using vvl = vector<vector<ll>>;
using vvvl = vector<vector<vector<ll>>>;

typedef pair<ll, ll> pll;
bool paircomp(const pll &a, const pll &b) {
  if (a.first == b.first)
    return a.second < b.second;
  return a.first < b.first;
}

#define REP(i, n) for (ll i = 0; i < (n); i++)
#define RREP(i, n) for (ll i = (n)-1; i >= 0; i--)
#define FOR(i, a, b) for (ll i = (a); i < (b); i++)
#define AUTO(i, m) for (auto &i : m)
#define ALL(a) (a).begin(), (a).end()
#define MAX(vec) *std::max_element(vec.begin(), vec.end())
#define MIN(vec) *std::min_element(vec.begin(), vec.end())
#define ARGMAX(vec)                                                            \
  std::distance(vec.begin(), std::max_element(vec.begin(), vec.end()))
#define ARGMIN(vec)                                                            \
  std::distance(vec.begin(), std::min_element(vec.begin(), vec.end()))
#define REV(T) greater<T>()
#define PQ(T) priority_queue<T, vector<T>, greater<T>>
#define VVL(a, b, c) vector<vector<ll>>(a, vector<ll>(b, c))
#define VV(T, a, b, c) vector<vector<T>>(a, vector<T>(b, c))
#define VVVL(a, b, c, d)                                                       \
  vector<vector<vector<ll>>>(a, vector<vector<ll>>(b, vector<ll>(c, d)))
#define VVV(T, a, b, c, d)                                                     \
  vector<vector<vector<T>>>(a, vector<vector<T>>(b, vector<T>(c, d)))
#define SP(a) setprecision(a)
#define SQRT(a) sqrt((long double)(a))
#define DPOW(a, b) pow((long double)(a), (long double)(b))
#define UNIQUE(vec)                                                            \
  do {                                                                         \
    sort(ALL((vec)));                                                          \
    (vec).erase(std::unique(ALL((vec))), (vec).end());                         \
  } while (0)

ll POW(ll n, ll m) {
  if (m == 0) {
    return 1;
  } else if (m % 2 == 0) {
    ll tmp = POW(n, m / 2);
    return (tmp * tmp);
  } else {
    return (n * POW(n, m - 1));
  }
}

int dx[4] = {1, 0, -1, 0};
int dy[4] = {0, 1, 0, -1};

bool func(vvl &G, map<pll, ll> &D, vvl &K, ll s, ll g, ll p, ll i) {
  if (g == s)
    return true;
  bool all = false;
  AUTO(c, G[s]) {
    if (p != c) {
      bool ok = func(G, D, K, c, g, s, i);
      if (ok) {
        all = true;
        K[i][D[make_pair(c, s)]] = 1;
      }
    }
  }
  return all;
}

int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  ll N, M;
  cin >> N;
  vvl G(N);
  map<pll, ll> D;
  REP(i, N - 1) {
    ll a, b;
    cin >> a >> b;
    a--;
    b--;
    G[a].push_back(b);
    G[b].push_back(a);
    D[make_pair(a, b)] = i;
    D[make_pair(b, a)] = i;
  }
  cin >> M;
  vvl K = VVL(M, N - 1, 0);
  REP(i, M) {
    ll u, v;
    cin >> u >> v;
    u--;
    v--;
    func(G, D, K, u, v, -1, i);
  }
  /*REP(i, M) {
    REP(j, N - 1) cout << K[i][j] << " ";
    cout << endl;
  }*/
  vl DP(1LL << M, 0);
  DP[0] = 1;
  REP(i, N - 1) {
    vl DPC = DP;
    // REP(j, 1LL << M) DP[j] = 0;
    REP(j, 1LL << M) {
      ll bit = j;
      REP(k, M) {
        if (K[k][i] == 1)
          bit |= (1LL << k);
      }
      DP[bit] += DPC[j];
    }
    // cout << DP[0] << "," << DP[1] << "," << DP[2] << "," << DP[3] << ","
    //     << DP[4] << "," << DP[5] << "," << DP[6] << "," << DP[7] << endl;
  }
  cout << DP[(1LL << M) - 1] << endl;

  return 0;
}


Measured memory_bytes: 16640