#include <bits/stdc++.h>
#include <ext/rope>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
//#pragma GCC optimize("Ofast")
//#pragma GCC optimize("unroll-loops")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
//#define int long long
#define pb push_back
#define x first
#define y second
#define mk(a,b) make_pair(a,b)
#define rr return 0
#define sqr(a) ((a)*(a))
#define all(a) (a).begin(), (a).end()
#define sz(a) (int)(a).size()

using namespace std;
using namespace __gnu_cxx;
using namespace __gnu_pbds;

using ll = long long;
using ld = long double;
using pii = pair<int, int>;
using pll = pair<ll, ll>;

template<class value, class cmp = less<value> >
using ordered_set = tree<value, null_type, cmp, rb_tree_tag, tree_order_statistics_node_update>;
template<class value, class cmp = less_equal<value> >
using ordered_multiset = tree<value, null_type, cmp, rb_tree_tag, tree_order_statistics_node_update>;
template<class key, class value, class cmp = less<key> >
using ordered_map = tree<key, value, cmp, rb_tree_tag, tree_order_statistics_node_update>;

/// find_by_order()
/// order_of_key()
mt19937 rng(chrono::high_resolution_clock::now().time_since_epoch().count());
inline int randll(int l = INT_MIN, int r = INT_MAX) {
    return uniform_int_distribution<int>(l, r)(rng);
}
const int INF = 1e9, MOD = 1e9 + 7; /// think
const ll LINF = 1e18;


const int dx[] = {0, 0, 1, -1}, dy[] = {1, -1, 0, 0};
inline bool inside (int x, int y, int n, int m) {
    return 0 <= x && 0 <= y && x < n && y < m;
}

template<class T> bool umin (T &a, T b) {return a > b ? (a = b, true) : false; }
template<class T> bool umax (T &a, T b) {return a < b ? (a = b, true) : false; }

int n;
vector <vector <pair<int, int> > > edge, pr;
inline void bfs (int v) {
    pr[v].assign(n, {INF, -1});
    pr[v][v] = {v, -1};
    queue <int> q;
    q.push(v);
    while (!q.empty()) {
        int V = q.front();
        q.pop();
        for (pii to : edge[V]) {
            if (pr[v][to.x].x == INF) {
                pr[v][to.x] = {V, to.y};
                q.push(to.x);
            }
        }
    }
}
main()
{
    ios::sync_with_stdio(0);
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    cin >> n;
    edge.resize(n);
    for (int i = 1, a, b; i < n; i++) {
        cin >> a >> b;
        --a, --b;
        edge[a].pb({b, i - 1});
        edge[b].pb({a, i - 1});
    }
    int m;
    cin >> m;
    vector <pii> e(m);
    for (auto &i : e) {
        cin >> i.x >> i.y;
        --i.x, --i.y;
    }
    pr.resize(n);
    for (int i = 0; i < n; i++) {
        bfs(i);
    }
    ll ans = 0;
    for (int mask = 0; mask < (1 << m); mask++) {
        int cnt = 0;
        vector <int> var(n - 1, 2);
        for (int j = 0; j < m; j++) {
            if (mask & (1 << j)) {
                ++cnt;
                int v = e[j].x, to = e[j].y, V = e[j].x;
                while (pr[V][to].y != -1) {
                    var[pr[V][to].y] = 1;
                    to = pr[V][to].x;
                }
            }
        }
        ll cur = 1;
        for (int i = 0; i < n - 1; i++) {
            cur *= var[i];
        }
        if (cnt & 1) {
            ans -= cur;
        }
        else ans += cur;
    }
    cout << ans << '\n';
}


Measured memory_bytes: 3652