#include <bits/stdc++.h>
using namespace std;

#define NDEBUG
#include <cassert>


typedef long long ll;
typedef long double Double;
typedef unsigned long long ull;
typedef pair<int,int> ii;
typedef pair<ll,ll> llll;
typedef pair<double,double> dd;

typedef vector<int> vi;
typedef vector<vector<int>> vvi;
typedef vector<ii> vii;
typedef vector<vector<ii>> vvii;
typedef vector<ll> vll;
typedef vector<vector<ll>> vvll;
typedef vector<llll> vllll;
typedef vector<bool> vb;
typedef vector<string> vs;
typedef vector<double> vd;
typedef vector<long double> vD;

#define sz(a)  int((a).size())
#define pb  push_back
#define eb  emplace_back
#define FOR(var,from,to) for(int var=(from);var<=(to);++var)
#define rep(var,n)  for(int var=0;var<(n);++var)
#define rep1(var,n)  for(int var=1;var<=(n);++var)
#define repC2(vari,varj,n)  for(int vari=0;vari<(n)-1;++vari)for(int varj=vari+1;varj<(n);++varj)
#define repC3(vari,varj,vark,n)  for(int vari=0;vari<(n)-2;++vari)for(int varj=vari+1;varj<(n)-1;++varj)for(int vark=varj+1;vark<(n);++vark)
#define ALL(c)  (c).begin(),(c).end()
#define RALL(c)  (c).rbegin(),(c).rend()
#define tr(i,c)  for(auto i=(c).begin(); i!=(c).end(); ++i)
#define mset(arr,val)  memset(arr,val,sizeof(arr))
#define mid(x,y) ((x)+((y)-(x))/2)
#define IN(x,a,b) ((a)<=(x)&&(x)<=(b))
#define cons make_pair
#define clamp(v,lo,hi) min(max(v,lo),hi)

template <typename T>
inline bool found(set<T> &s, T elem) { return s.find(elem) != s.end(); }
template <typename T>
inline bool found(unordered_set<T> &s, T elem) { return s.find(elem) != s.end(); }
template <typename T, typename U>
inline bool found(map<T,U> &s, U elem) { return s.find(elem) != s.end(); }
template <typename T, typename U>
inline bool found(unordered_map<T,U> &s, U elem) { return s.find(elem) != s.end(); }
template <typename T>
inline bool found(vector<T> &s, T elem) { return find(s.begin(), s.end(), elem) != s.end(); }
inline int found(string &s, string t) { return (int)s.find(t); }
inline int found(string &s, int c) { return (int)s.find(c); }

template<typename T1, typename T2> inline void amin(T1 & a, T2 const & b) { if (a>b) a=b; }
template<typename T1, typename T2> inline void amax(T1 & a, T2 const & b) { if (a<b) a=b; }
template<typename X, typename T> auto vectors(X x, T a) { return vector<T>(x, a); }
template<typename X, typename Y, typename Z, typename... Zs> auto vectors(X x, Y y, Z z, Zs... zs) { auto cont = vectors(y, z, zs...); return vector<decltype(cont)>(x, cont); }

inline ll square(ll x) { return x * x; }
inline ll gcd(ll a, ll b) { while(a) swap(a, b%=a); return b; }
template <typename T>
inline T mod(T a, T b) { return ((a % b) + b) % b; }

template <typename T>
int find_left(vector<T>& v, T elem) {
    return (int)(upper_bound(v.begin(), v.end(), elem) - v.begin()) - 1;
}
template <typename T>
int find_right(vector<T>& v, T elem) {
    return (int)(lower_bound(v.begin(), v.end(), elem) - v.begin());
}

const ll MOD=1000000007LL;

ll ADD(ll x, ll y) { return (x+y) % MOD; }
ll SUB(ll x, ll y) { return (x-y+MOD) % MOD; }
ll MUL(ll x, ll y) { return x*y % MOD; }
ll POW(ll x, ll e) { ll v=1; for(; e; x=MUL(x,x), e>>=1) if (e&1) v = MUL(v,x); return v; }
ll DIV(ll x, ll y) { /*assert(y%MOD!=0);*/ return MUL(x, POW(y, MOD-2)); }

ll solve(int N, vi& a, vi& b, int M, vi& u, vi& v) {
    vvi nxt(N);
    map<ii, int> pair2edge;
    rep(i,N-1) {
        --a[i]; --b[i];
        nxt[a[i]].pb(b[i]);
        nxt[b[i]].pb(a[i]);
        pair2edge[ ii(a[i], b[i]) ] = pair2edge[ ii(b[i], a[i]) ] = i;
    }
    int P = 1 << M;
    vll f(P, 0);
    rep(s,M) {
        int start = --u[s], goal = --v[s];
        vi prev(N, -1);
        queue<int> q; q.push(start);
        while (!q.empty()){
            int i = q.front(); q.pop();
            if (i == goal) break;
            for (int j : nxt[i]){
                if (prev[j] >= 0) continue;
                prev[j] = i;
                q.push(j);
            }
        }
        for (int n=goal; n!=start; ){
            if (prev[n] < 0) break;

            int edge = pair2edge[ii(prev[n], n)];
            f[1 << s] |= (1LL << (ll)edge);
            n = prev[n];
        }
    }


    rep(i,M) rep(j,1<<M) if (j & (1<<i)) f[j] |= f[j^(1<<i)];

    vll g(P);
    rep(i,P) {
        int pcnt =__builtin_popcountll(f[i]);
        g[i] = 1LL << (ll)(N-1 - pcnt);
    }

    rep(i,M) rep(j,1<<M) if (j & (1<<i)) g[j] -= g[j^(1<<i)];


    ll ans = g[P-1];

    return max(ans,-ans);

}

int main() {
    int N; cin >> N;
    vi a(N-1), b(N-1); rep(i,N-1) cin >> a[i] >> b[i];
    int M; cin >> M;
    vi u(M), v(M); rep(i,M) cin >> u[i] >> v[i];
    cout << solve(N,a,b,M,u,v) << endl;
    return 0;
}



Measured memory_bytes: 16640