#include <bits/stdc++.h>
 
//#include <unistd.h>
//#include <iostream>
 
using namespace std;
 
#define DEBUG(x) cerr<<#x<<": "<<x<<endl;
#define DEBUG_VEC(v) cerr<<#v<<":";for(int i=0;i<v.size();i++) cerr<<" "<<v[i]; cerr<<endl;
#define DEBUG_MAT(v) cerr<<#v<<endl;for(int i=0;i<v.size();i++){for(int j=0;j<v[i].size();j++) {cerr<<v[i][j]<<" ";}cerr<<endl;}
typedef long long ll;
#define int ll
 
#define vi vector<int>
#define vl vector<ll>
#define vii vector< vector<int> >
#define vll vector< vector<ll> >
#define vs vector<string>
#define pii pair<int,int>
#define pis pair<int,string>
#define psi pair<string,int>
#define pll pair<ll,ll>
template<class S, class T> pair<S, T> operator+(const pair<S, T> &s, const pair<S, T> &t) { return pair<S, T>(s.first + t.first, s.second + t.second); }
template<class S, class T> pair<S, T> operator-(const pair<S, T> &s, const pair<S, T> &t) { return pair<S, T>(s.first - t.first, s.second - t.second); }
template<class S, class T> ostream& operator<<(ostream& os, pair<S, T> p) { os << "(" << p.first << ", " << p.second << ")"; return os; }
#define X first
#define Y second
#define rep(i,n) for(int i=0;i<(n);i++)
#define rep1(i,n) for(int i=1;i<=(n);i++)
#define rrep(i,n) for(int i=(n)-1;i>=0;i--)
#define rrep1(i,n) for(int i=(n);i>0;i--)
#define REP(i,a,b) for(int i=a;i<b;i++)
#define in(x, a, b) (a <= x && x < b)
#define all(c) c.begin(),c.end()
template<class T> bool chmax(T &a, const T &b) { if (a<b) { a = b; return 1; } return 0; }
template<class T> bool chmin(T &a, const T &b) { if (a>b) { a = b; return 1; } return 0; }
#define UNIQUE(v) v.erase(std::unique(v.begin(), v.end()), v.end());
const ll inf = 1000000001;
const ll INF = (ll)1e18 + 1;
const long double pi = 3.1415926535897932384626433832795028841971L;
#define Sp(p) cout<<setprecision(25)<< fixed<<p<<endl;
int dx[4] = {1, 0, -1, 0}, dy[4] = {0, 1, 0, -1};
int dx2[8] = { 1,1,0,-1,-1,-1,0,1 }, dy2[8] = { 0,1,1,1,0,-1,-1,-1 };
#define fio() cin.tie(0); ios::sync_with_stdio(false);
const ll MOD = 1000000007;
//const ll MOD = 998244353;
// #define mp make_pair
//#define endl '\n'

vector<vector<pii>> G;

bool dfs(int now, int tar, vi& visited, vi& his) {
  if (now == tar) {
    return true;
  }
  visited[now] = true;
  rep (i, G[now].size()) {
    int ch = G[now][i].first, idx = G[now][i].second;
    if (visited[ch]) continue;
    his.push_back(idx);
    if (dfs(ch, tar, visited, his)) {
      return true;
    }
    else {
      his.pop_back();
    }
  }
  return false;
}

signed main() {
  int n;
  cin >> n;
  G.resize(n);
  vector<pii> ab(n - 1);
  rep (i, n - 1) {
    int u, v;
    cin >> u >> v;
    u--; v--;
    G[u].push_back(pii(v, i));
    G[v].push_back(pii(u, i));
    ab[i] = pii(u, v);
  }

  int m;
  cin >> m;
  vector<pii> uv(m);
  vii his(m);
  rep (i, m) {
    int u, v;
    cin >> u >> v;
    u--; v--;
    uv[i] = pii(u, v);
    vi visited(n);
    dfs(u, v, visited, his[i]);
  }
  //DEBUG_MAT(his);

  vl dp(1 << m);
  dp[0] = 0;
  rep (i, 1 << m) {
    rep (j, m) {
      if ((i & (1 << j)) == 0) {
        int ni = i | (1 << j);
        if (dp[ni] != 0) continue;
        dp[ni] = dp[i];
        rep (k, his[j].size()) {
          int idx = his[j][k];
          dp[ni] |= (1LL << idx);
        }
      }
    }
  }
  //DEBUG_VEC(dp);

  vl power2(51);
  power2[0] = 1;
  rep (i, 50) {
    power2[i + 1] = power2[i] * 2;
  }

  ll ans = 0;
  rep (i, 1 << m) {
    int cnt = 0;
    rep (j, m) {
      if ((i & (1 << j)) == 0) continue;
      cnt++;
    }
    int rem = 0;
    rep (k, n - 1) {
      if ((dp[i] & (1LL << k)) == 0) rem++;
    }
    //DEBUG(rem);
    if (cnt % 2 == 0) {
      ans += power2[rem];
    }
    else {
      ans -= power2[rem];
    }
  }
  cout << ans << endl;
}

Measured memory_bytes: 8448