#include <cassert>
#include <cmath>
#include <cstdint>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <functional>
#include <iostream>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>

using namespace std;

using Int = long long;

template <class T1, class T2> ostream &operator<<(ostream &os, const pair<T1, T2> &a) { return os << "(" << a.first << ", " << a.second << ")"; };
template <class T> ostream &operator<<(ostream &os, const vector<T> &as) { const int sz = as.size(); os << "["; for (int i = 0; i < sz; ++i) { if (i >= 256) { os << ", ..."; break; } if (i > 0) { os << ", "; } os << as[i]; } return os << "]"; }
template <class T> void pv(T a, T b) { for (T i = a; i != b; ++i) cerr << *i << " "; cerr << endl; }
template <class T> bool chmin(T &t, const T &f) { if (t > f) { t = f; return true; } return false; }
template <class T> bool chmax(T &t, const T &f) { if (t < f) { t = f; return true; } return false; }

////////////////////////////////////////////////////////////////////////////////
template <unsigned M_> struct ModInt {
  static constexpr unsigned M = M_;
  unsigned x;
  constexpr ModInt() : x(0U) {}
  constexpr ModInt(unsigned x_) : x(x_ % M) {}
  constexpr ModInt(unsigned long long x_) : x(x_ % M) {}
  constexpr ModInt(int x_) : x(((x_ %= static_cast<int>(M)) < 0) ? (x_ + static_cast<int>(M)) : x_) {}
  constexpr ModInt(long long x_) : x(((x_ %= static_cast<long long>(M)) < 0) ? (x_ + static_cast<long long>(M)) : x_) {}
  ModInt &operator+=(const ModInt &a) { x = ((x += a.x) >= M) ? (x - M) : x; return *this; }
  ModInt &operator-=(const ModInt &a) { x = ((x -= a.x) >= M) ? (x + M) : x; return *this; }
  ModInt &operator*=(const ModInt &a) { x = (static_cast<unsigned long long>(x) * a.x) % M; return *this; }
  ModInt &operator/=(const ModInt &a) { return (*this *= a.inv()); }
  ModInt pow(long long e) const {
    if (e < 0) return inv().pow(-e);
    ModInt a = *this, b = 1U; for (; e; e >>= 1) { if (e & 1) b *= a; a *= a; } return b;
  }
  ModInt inv() const {
    unsigned a = M, b = x; int y = 0, z = 1;
    for (; b; ) { const unsigned q = a / b; const unsigned c = a - q * b; a = b; b = c; const int w = y - static_cast<int>(q) * z; y = z; z = w; }
    assert(a == 1U); return ModInt(y);
  }
  ModInt operator+() const { return *this; }
  ModInt operator-() const { ModInt a; a.x = x ? (M - x) : 0U; return a; }
  ModInt operator+(const ModInt &a) const { return (ModInt(*this) += a); }
  ModInt operator-(const ModInt &a) const { return (ModInt(*this) -= a); }
  ModInt operator*(const ModInt &a) const { return (ModInt(*this) *= a); }
  ModInt operator/(const ModInt &a) const { return (ModInt(*this) /= a); }
  template <class T> friend ModInt operator+(T a, const ModInt &b) { return (ModInt(a) += b); }
  template <class T> friend ModInt operator-(T a, const ModInt &b) { return (ModInt(a) -= b); }
  template <class T> friend ModInt operator*(T a, const ModInt &b) { return (ModInt(a) *= b); }
  template <class T> friend ModInt operator/(T a, const ModInt &b) { return (ModInt(a) /= b); }
  explicit operator bool() const { return x; }
  bool operator==(const ModInt &a) const { return (x == a.x); }
  bool operator!=(const ModInt &a) const { return (x != a.x); }
  friend std::ostream &operator<<(std::ostream &os, const ModInt &a) { return os << a.x; }
};
////////////////////////////////////////////////////////////////////////////////

constexpr unsigned MO = 998244353;
using Mint = ModInt<MO>;


struct Node {
  int l, r;
  Mint same;
  // lazy: t -> p t + q
  Mint p, q;
  Node() : l(-1), r(-1), p(1), q(0) {}
  void mul(Mint val) {
    same *= val;
    p *= val;
    q *= val;
  }
  void add(Mint val) {
    same += val;
    q += val;
  }
};
vector<Node> nodes;
int newNode() {
  const int u = nodes.size();
  nodes.emplace_back();
  return u;
}
void push(int u) {
  const int l = nodes[u].l;
  const int r = nodes[u].r;
  Mint &p = nodes[u].p;
  Mint &q = nodes[u].q;
  if (!(p == 1 && q == 0)) {
    if (~l) {
      nodes[l].mul(p);
      nodes[l].add(q);
    }
    if (~r) {
      nodes[r].mul(p);
      nodes[r].add(q);
    }
    p = 1;
    q = 0;
  }
}
void pull(int u, int l, int r) {
  assert(~l || ~r);
  nodes[u].l = l;
  nodes[u].r = r;
}
int merge(int u, int v) {
// cerr<<"  merge "<<u<<" "<<v<<endl;
  if (!~u) return v;
  if (!~v) return u;
  if (!~nodes[u].l && !~nodes[u].r) {
    nodes[v].mul(nodes[u].same);
    return v;
  }
  if (!~nodes[v].l && !~nodes[v].r) {
    nodes[u].mul(nodes[v].same);
    return u;
  }
  push(u);
  push(v);
  const int l = merge(nodes[u].l, nodes[v].l);
  const int r = merge(nodes[u].r, nodes[v].r);
  pull(u, l, r);
  return u;
}
int segN;
int build(int L, int R, int a, int b, Mint valOut, Mint valIn) {
  if (b <= L || R <= a) {
    const int u = newNode();
    nodes[u].same = valOut;
    return u;
  }
  if (a <= L && R <= b) {
    const int u = newNode();
    nodes[u].same = valIn;
    return u;
  }
  const int Mid = (L + R) >> 1;
  const int l = build(L, Mid, a, b, valOut, valIn);
  const int r = build(Mid, R, a, b, valOut, valIn);
  const int u = newNode();
  pull(u, l, r);
  return u;
}
int filter(int L, int R, int u, int a, int b) {
  if (b <= L || R <= a) {
    nodes[u].mul(0);
    return u;
  }
  if (a <= L && R <= b) {
    return u;
  }
  const int Mid = (L + R) >> 1;
  push(u);
  if (!~nodes[u].l && !~nodes[u].r) {
    const int l = newNode();
    const int r = newNode();
    nodes[u].l = l;
    nodes[u].r = r;
    nodes[l].same = nodes[r].same = nodes[u].same;
  }
  const int l = nodes[u].l;
  const int r = nodes[u].r;
  filter(L, Mid, l, a, b);
  filter(Mid, R, r, a, b);
  pull(u, l, r);
  return u;
}
void add(int L, int R, int u, int a, int b, Mint val) {
  if (!~u) return;
  if (b <= L || R <= a) return;
  if (a <= L && R <= b) {
    nodes[u].add(val);
    return;
  }
  const int Mid = (L + R) >> 1;
  const int l = nodes[u].l;
  const int r = nodes[u].r;
  push(u);
  add(L, Mid, l, a, b, val);
  add(Mid, R, r, a, b, val);
  pull(u, l, r);
}
Mint get(int L, int R, int u, int a) {
  assert(~u);
  const int l = nodes[u].l;
  const int r = nodes[u].r;
  if (!~l && !~r) return nodes[u].same;
  push(u);
  const int Mid = (L + R) >> 1;
  if (a < Mid) {
    return get(L, Mid, l, a);
  } else {
    return get(Mid, R, r, a);
  }
}


int N;
vector<int> A, B;
int M;
vector<int> S, T;

vector<vector<int>> graph;
vector<int> dep;
void dfs(int u, int p) {
  dep[u] = (~p) ? (dep[p] + 1) : 0;
  auto it = find(graph[u].begin(), graph[u].end(), p);
  if (it != graph[u].end()) {
    graph[u].erase(it);
  }
  for (const int v : graph[u]) {
    dfs(v, u);
  }
}

vector<int> maxDs;

int solve(int u) {
  const int d = dep[u];
  int ret = build(0, segN, 0, d + 1, 0, 1);
  for (const int v : graph[u]) {
    int res = solve(v);
    const Mint tail = get(0, segN, res, d + 1);
// cerr<<"  "<<u<<" "<<v<<": tail = "<<tail<<"; ";for(int x=0;x<=d+1;++x)cerr<<get(0,segN,res,x)<<" ";cerr<<endl;
    res = filter(0, segN, res, 0, d + 1);
// cerr<<"  "<<u<<" "<<v<<": tail = "<<tail<<"; ";for(int x=0;x<=d+1;++x)cerr<<get(0,segN,res,x)<<" ";cerr<<endl;
    add(0, segN, res, 0, d + 1, tail);
// cerr<<"  "<<u<<" "<<v<<": tail = "<<tail<<"; ";for(int x=0;x<=d+1;++x)cerr<<get(0,segN,res,x)<<" ";cerr<<endl;
    ret = merge(ret, res);
  }
// cerr<<u<<": ";for(int x=0;x<=d;++x)cerr<<get(0,segN,ret,x)<<" ";cerr<<endl;
  if (~maxDs[u]) {
    ret = filter(0, segN, ret, maxDs[u] + 1, d + 1);
// cerr<<u<<": ";for(int x=0;x<=d;++x)cerr<<get(0,segN,ret,x)<<" ";cerr<<endl;
  }
  return ret;
}

int main() {
  for (; ~scanf("%d", &N); ) {
    A.resize(N - 1);
    B.resize(N - 1);
    for (int i = 0; i < N - 1; ++i) {
      scanf("%d%d", &A[i], &B[i]);
      --A[i];
      --B[i];
    }
    scanf("%d", &M);
    S.resize(M);
    T.resize(M);
    for (int j = 0; j < M; ++j) {
      scanf("%d%d", &S[j], &T[j]);
      --S[j];
      --T[j];
    }
cerr<<"N = "<<N<<", M = "<<M<<endl;
    
    graph.assign(N, {});
    for (int i = 0; i < N - 1; ++i) {
      graph[A[i]].push_back(B[i]);
      graph[B[i]].push_back(A[i]);
    }
    dep.assign(N, -1);
    dfs(0, -1);
    
    const int maxDep = *max_element(dep.begin(), dep.end());
    for (segN = 1; segN < maxDep + 1; segN <<= 1) {}
    nodes.clear();
    
    maxDs.assign(N, -1);
    for (int j = 0; j < M; ++j) {
      chmax(maxDs[T[j]], dep[S[j]]);
    }
// cerr<<"maxDs = "<<maxDs<<endl;
    
    const int res = solve(0);
    const Mint ans = get(0, segN, res, 0);
    printf("%u\n", ans.x);
cerr<<"|nodes| = "<<nodes.size()<<endl;
  }
  return 0;
}