#ifndef DEBUG
#  define NDEBUG
#endif
#include <iostream>
#include <string>
#include <iterator>
#include <utility>
#include <type_traits>
#include <limits>
#include <cassert>
#include <vector>

using namespace std;

// template {{{
// misc {{{
using Z = long long;
[[maybe_unused]]
constexpr Z INF = numeric_limits<Z>::max() / 3;
// }}}

// debug {{{
template <class T>
using enable_if_sequence_t = enable_if_t<
  is_same<
    typename iterator_traits<
      typename remove_cv_t<remove_reference_t<T>>::iterator
    >::iterator_category,
    random_access_iterator_tag>{}>;
#ifdef NDEBUG
# define dump(x)
# define debug if (0)
template <class T>
inline T&& ix(T&& value) { return value; }
template <class T, class Index, class... Indices, class = enable_if_sequence_t<T>>
inline auto&& ix(T&& container, Index index, Indices... indices) {
  return ix(container[index], indices...);
}
#else
# define dump(x) do { \
    cerr << "\e[33m[dump: " << __LINE__ << "] " << (#x) << " = " << x << "\e[0m" << endl; \
  } while (0);
# define debug
template <class T>
inline auto&& ix_impl([[maybe_unused]] int line, [[maybe_unused]] const char* code, T&& value) {
  return value;
}
template <class T, class Index, class... Indices, class = enable_if_sequence_t<T>>
inline auto&& ix_impl(int line, const char* code, T&& container, Index index, Indices... indices) {
  if (index < 0) {
    cerr << "\e[31mix: negative index at line " << line << ", ix(" << code << ")\e[0m" << endl;
    exit(1);
  }
  int size = container.size();
  if (index >= size) {
    cerr << "\e[31mix: index out of range at line " << line << ", ix(" << code << ")\n"
      << "index = " << index << " whereas size = " << size << "\e[0m" << endl;
    exit(1);
  }
  return ix_impl(line, code, container[index], indices...);
}
#define ix(...) ix_impl(__LINE__, #__VA_ARGS__, __VA_ARGS__)
#endif
// }}}

// IO {{{
template <class T, class U>
ostream& operator<< (ostream& os, pair<T, U> p) {
  os << '(' << p.first << ", " << p.second << ')';
  return os;
}
template <class T>
false_type is_container_impl(...);
template <class T, class = typename T::iterator>
true_type is_container_impl(T);
template <class T>
struct is_container : decltype(is_container_impl<T>(declval<T>())) {};
template <>
struct is_container <string> : std::false_type {};
template <class Container, class = enable_if_t<is_container<Container>{}>>
istream& operator>> (istream& is, Container& cont) {
  for (auto& v : cont) is >> v;
  return is;
}
template <class Container, class = enable_if_t<is_container<Container>{}>>
ostream& operator<< (ostream& os, Container const& cont) {
  bool first = true;
  constexpr char sep =
    is_container<typename Container::value_type>{} ? '\n' : ' ';
  for (auto const& v : cont) {
    if (!first) {
      os << sep;
    }
    first = false;
    os << v;
  }
  return os;
}
// }}}
// }}}

struct edge {
  Z to, id;
};

using Graph = vector<vector<edge>>;

Z path(Graph const& gr, Z from, Z to, Z prev) {
  if (from == to) return 0;
  for (auto&& e : ix(gr, from)) {
    if (e.to == prev) continue;
    Z next = path(gr, e.to, to, from);
    if (next >= 0) return next | (1ll << e.id);
  }
  return -1;
}

int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(nullptr);
  Z N;
  cin >> N;
  Z E = N - 1;
  Graph graph(N);
  vector<Z> as(E), bs(E);
  for (auto i = 0; i < E; i++) {
    cin >> ix(as, i) >> ix(bs, i);
    ix(as, i)--;
    ix(bs, i)--;
    ix(graph, ix(as, i)).push_back({ix(bs, i), i});
    ix(graph, ix(bs, i)).push_back({ix(as, i), i});
  }
  Z M;
  cin >> M;
  dump(M);
  vector<Z> us(M), vs(M);
  for (auto i = 0; i < M; i++) {
    cin >> ix(us, i) >> ix(vs, i);
    ix(us, i)--;
    ix(vs, i)--;
  }
  vector<Z> masks(M);
  for (auto i = 0; i < M; i++)
    ix(masks, i) = path(graph, ix(us, i), ix(vs, i), -1);
  dump(masks);
  vector<Z> effects(E);
  for (auto i = 0; i < E; i++)
    for (auto j = 0; j < M; j++)
      if (ix(masks, j) & (1ll << i))
        ix(effects, i) |= (1 << j);
  vector<vector<Z>> dp(E + 1, vector<Z>(1 << M, 0));
  ix(dp, 0, 0) = 1;
  for (auto i = 0; i < E; i++) {
    for (auto j = 0; j < (1 << M); j++) {
      ix(dp, i + 1, j) += ix(dp, i, j);
      ix(dp, i + 1, j | ix(effects, i)) += ix(dp, i, j);
    }
  }
  cout << ix(dp, E, (1 << M) - 1) << endl;
}



Measured memory_bytes: 418304