#pragma GCC optimize ("O3")
#pragma GCC target ("sse4")
 
#include <bits/stdc++.h>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/assoc_container.hpp>
 
using namespace std;
using namespace __gnu_pbds;
 
typedef long long ll;
typedef long double ld;
typedef complex<ld> cd;
 
typedef pair<int, int> pi;
typedef pair<ll,ll> pl;
typedef pair<ld,ld> pd;
 
typedef vector<int> vi;
typedef vector<ld> vd;
typedef vector<ll> vl;
typedef vector<pi> vpi;
typedef vector<pl> vpl;
typedef vector<cd> vcd;
 
template <class T> using Tree = tree<T, null_type, less<T>, rb_tree_tag,tree_order_statistics_node_update>;
 
#define FOR(i, a, b) for (int i=a; i<(b); i++)
#define F0R(i, a) for (int i=0; i<(a); i++)
#define FORd(i,a,b) for (int i = (b)-1; i >= a; i--)
#define F0Rd(i,a) for (int i = (a)-1; i >= 0; i--)
 
#define sz(x) (int)(x).size()
#define mp make_pair
#define pb push_back
#define f first
#define s second
#define lb lower_bound
#define ub upper_bound
#define all(x) x.begin(), x.end()
 
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
 
const ll MOD = 1000000000000000007;
const ll INF = 1e18;
const int MX = 100001; //check the limits, dummy
 
ll modExp(ll base, ll power) {
    if (power == 0) {
        return 1;
    } else {
        ll cur = modExp(base, power / 2); cur = cur * cur; cur = cur % MOD;
        if (power % 2 == 1) cur = cur * base;
        cur = cur % MOD;
        return cur;
    }
}

ll inv(ll base) {
    int g = MOD, r = base, x = 0, y = 1;
    while (r != 0) {
        int q = g / r;
        g %= r; swap(g, r);
        x -= q * y; swap(x, y);
    }
    return x < 0 ? x+MOD : x;
}

ll mul(ll A, ll B) {
	return (A*B)%MOD;
}

ll add(ll A, ll B) {
	return (A+B)%MOD;
}

ll dvd(ll A, ll B) {
    return mul(A, inv(B));
}

ll sub(ll A, ll B) {
    return (A-B+MOD)%MOD;
}
int main() {
	ios_base::sync_with_stdio(0); cin.tie(0);    
	
    vector<vector<pi> > graph;
    int N; cin >> N;
    F0R(i, N) {
        vpi g; graph.pb(g);
    }

    F0R(i, N-1) {
        int A, B; cin >> A >> B; A--; B--;
        graph[A].pb({B, i});
        graph[B].pb({A, i});
    }
    int M; cin >> M;
    vpi paths(M);
    F0R(i, M) {
        int A, B; cin >> A >> B; A--; B--;
        paths[i] = {A, B};
    }

    map<pi, vi> edges;
    F0R(root, N) {
        int last[N], edge[N];
        F0R(i, N) {
            last[i] = -1;
        }
        last[root] = -2;
        queue<int> q; q.push(root);
        while (!q.empty()) {
            int cur = q.front(); q.pop();
            F0R(i, sz(graph[cur])) {
                int nxt = graph[cur][i].f;
                int curEdge = graph[cur][i].s;
                if (last[nxt] != -1) continue;
                last[nxt] = cur;
                vi curList = edges[{root, cur}];
                curList.pb(curEdge);
                edges[{root, nxt}] = curList; 
                q.push(nxt);
            }
        }


    }

    vector<vector<bool> > useds((1 << M));
    ll ans = 0;
    F0R(mask, (1 << M)) {
        int leastSet = -1;
        F0R(i, M) {
            if (mask & (1 << i)) {
                leastSet = i; break;
            }
        }
        int cnt = 0;
        F0R(i, M) if (mask & (1 << i)) cnt++;
        if (leastSet == -1) {
            vector<bool> blank(N-1); F0R(i, N-1) blank[i] = false;
            useds[0] = blank;
            ans += modExp(2, N-1);
            continue;
        }
        vector<bool> cur = useds[mask - (1 << leastSet)];
        vi xUsed = edges[paths[leastSet]];
        F0R(i, sz(xUsed)) {
            cur[xUsed[i]] = true;
        }
        int cnts = 0; F0R(i, sz(cur)) if (cur[i]) cnts++;
        ll val = modExp(2, N-1-cnts);
        if (cnt % 2) {
            ans -= val;
        } else {
            ans += val;
        }
        useds[mask] = cur;
    }
    cout << ans << endl;
	
	return 0;
}
 
// read the question correctly (ll vs int)
// template by bqi343



Measured memory_bytes: 74368