const int isDebugMode = 1;
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<long long, long long> P;
struct edge{long long to,cost;};
const int inf = 1 << 27;
const long long INF = 1LL << 60;
const int COMBMAX = 1001001;
const long long MOD = 1000000007;
const long long dy[] = {-1, 0, 0, 1};
const long long dx[] = {0, -1, 1, 0};
string abc = "abcdefghijklmnopqrstuvwxyz";
#define rep(i,n) for(int i = 0; i < (n); ++i)
#define eachdo(v, e) for (const auto &e : (v))
#define all(v) (v).begin(), (v).end()
#define lower_index(v, e) (long long)distance((v).begin(), lower_bound((v).begin(), (v).end(), e))
#define upper_index(v, e) (long long)distance((v).begin(), upper_bound((v).begin(), (v).end(), e))
long long mpow(long long a, long long n, long long mod = MOD){long long res = 1; while(n > 0){if(n & 1)res = res * a % mod; a = a * a % mod; n >>= 1;} return res;}
void pt(){cout << endl; return;}
template<class Head> void pt(Head&& head){cout << head; pt(); return;}
template<class Head, class... Tail> void pt(Head&& head, Tail&&... tail){cout << head << " "; pt(forward<Tail>(tail)...);}
void dpt(){if(!isDebugMode) return; cout << endl; return;}
template<class Head> void dpt(Head&& head){if(!isDebugMode) return; cout << head; pt(); return;}
template<class Head, class... Tail> void dpt(Head&& head, Tail&&... tail){if(!isDebugMode) return; cout << head << " "; pt(forward<Tail>(tail)...);}
template<class T> void debug(T v){if(!isDebugMode) return; rep(i, v.size()) cout << v[i] << " " ; cout << endl;}
template<class T> void debug2(T v){if(!isDebugMode) return; rep(i, v.size()){rep(j, v[i].size()) cout << v[i][j] << " " ; cout << endl;}}
template<class T1, class T2> inline bool chmin(T1 &a, T2 b){if(a > b){a = b; return true;} return false;}
template<class T1, class T2> inline bool chmax(T1 &a, T2 b){if(a < b){a = b; return true;} return false;}
template<class T1, class T2> long long recgcd(T1 a, T2 b){return a % b ? recgcd(b , a % b) : b;}
bool valid(long long H, long long W, long long h, long long w) { return 0 <= h && h < H && 0 <= w && w < W; }

int main(){
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    ll N; cin >> N;
    vector<ll> a(N - 1), b(N - 1), c(N - 1);
    rep(i, N - 1){
        cin >> a[i] >> b[i];
        a[i]--;
        b[i]--;
        c[i] = 1LL << i;
    }
    ll M; cin >> M;
    vector<ll> u(M), v(M);
    rep(i, M){
        cin >> u[i] >> v[i];
        u[i]--;
        v[i]--;
    }
    vector<vector<ll>> dist(N, vector<ll>(N, INF));
    rep(i, N) dist[i][i] = 0;
    rep(i, N - 1){
        dist[a[i]][b[i]] = c[i];
        dist[b[i]][a[i]] = c[i];
    }
    rep(k, N)rep(i, N)rep(j, N){
        chmin(dist[i][j], dist[i][k] + dist[k][j]);
    }
    ll ans = 0;
    for(ll S = 1; S < (1 << M); S++){
        ll path = 0;
        for(ll i = 0; i < M; i++){
            if(S >> i & 1){
                path |= dist[u[i]][v[i]];
            }
        }
        ll on = __builtin_popcountll(path);
        if (__builtin_popcountll(S) % 2){
            ans += 1LL << (N - 1 - on);
        }else{
            ans -= 1LL << (N - 1 - on);
        }
    }
    pt((1LL << N - 1) - ans);
    return 0;  
}

Measured memory_bytes: 3628