/* be name khoda */

// #define stream_enable
#define long_enable
#include <iostream>
#include <algorithm>
#include <cstring>
#include <numeric>
#include <iomanip>
#include <sstream>
#include <vector>
#include <queue>
#include <set>
#include <map>
using namespace std;

#ifdef stream_enable
#define cin sss
#endif
#ifdef long_enable
typedef long long int ll;
#else
typedef int ll;
#endif

typedef pair<ll, ll> pii;
typedef pair<pii, ll> ppi;
typedef pair<ll, pii> pip;
typedef vector<ll> vi;
typedef vector<pii> vpii;

const ll MOD = 1000000007;
const long long BIG = 1446803456761533460;
const int Big = 336860180;

#define F first
#define S second
#define pb push_back
#define eb emplace_back
#define all(x) (x).begin(), (x).end()

#define debug(x) cout << #x << " -> " << (x) << endl;
#define debug2(x, y) cout << #x << ' ' << #y << " -> " << (x) << ' ' << (y) << endl;
#define debug3(x, y, z) cout << #x << ' ' << #y << ' ' << #z << " -> " << (x) << ' ' << (y) << ' ' << (z) << endl;
#define debug4(x, y, z, t) cout << #x << ' ' << #y << ' ' << #z << ' ' << #t << " -> " << (x) << ' ' << (y) << ' ' << (z) << ' ' << (t) << endl;
#define debugp(x) cout << #x << " -> " << "(" << (x).F << ", " << (x).S << ")" << endl;
#define debuga(x, n) cout << #x << " -> "; fori (i1_da, n) { cout << (x)[i1_da] << ' '; } cout << endl
#define debugap(x, n) cout << #x << " ->\n"; fori (i1_dap, n) { cout << "(" << (x)[i1_dap].F << ", " << (x)[i1_dap].S << ")\n"; } cout << endl
#define debugaa(x, n, m) cout << #x << " ->\n"; fori (i1_daa, n) { fori (i2_daa, m) { cout << (x)[i1_daa][i2_daa] << ' '; } cout << '\n'; } cout << endl
#define debugav(x, n) cout << #x << " ->\n"; fori (i1_dav, n) { fori (i2_dav, (x)[i1_dav].size()) { cout << (x)[i1_dav][i2_dav] << ' '; } cout << '\n'; } cout << endl
#define debugia(x, n) cout << #x << " ->\n"; fori (i1_dia, n) { cout << i1_dia << " : " << (x)[i1_dia] << '\n'; } cout << endl

#define forifrom(i, s, n) for(ll i = (s); i < (n); ++i)
#define forirto(i, n, e) for(ll i = (n) - 1; i >= (e); --i)
#define fori(i, n) forifrom (i, 0, n)
#define forir(i, n) forirto (i, n, 0)

#define smin(a, b) a = min(a, (b))
#define smax(a, b) a = max(a, (b))

#define Add(a, b) a = (a + (b)) % MOD
#define Mul(a, b) a = (a * (b)) % MOD

stringstream sss;

// -----------------------------------------------------------------------

const ll maxn = 51;

ll n, m;
vi g[maxn];
pii prs[maxn];
ll lca[maxn][maxn];
ll st[maxn], ft[maxn];
ll ps[maxn];

ll tim = 0;
void dfs_stft(ll x, ll par) {
    st[x] = tim++;
    for (auto y : g[x]) {
        if (y != par) {
            dfs_stft(y, x);
        }
    }
    ft[x] = tim;
}

void dfs_lca(ll x, ll par) {
    fori (y, n) {
        lca[x][y] = (st[x] <= st[y] && ft[y] <= ft[x]) ? x : lca[par][y];
    }
    for (auto y : g[x]) if (y != par) dfs_lca(y, x);
}

ll dfs_ps(ll x, ll par) {
    ll v = 1;
    for (auto y : g[x]) {
        if (y == par) continue;
        v *= dfs_ps(y, x) * (1 + (ps[y] == 0));
        ps[x] += ps[y];
    }
    return v;
}

void MAIN() {

    cin >> n;
    fori (i, n - 1) {
        ll a, b; cin >> a >> b; --a, --b;
        g[a].eb(b), g[b].eb(a);
    }
    cin >> m;
    fori (i, m) {
        cin >> prs[i].F >> prs[i].S; --prs[i].F, --prs[i].S;
    }
    dfs_stft(0, 0);
    dfs_lca(0, 0);

    ll ans = 0;
    fori (b, 1 << m) {
        memset(ps, 0, sizeof ps);
        fori (i, m) {
            if (b >> i & 1) {
                ps[prs[i].F]++;
                ps[prs[i].S]++;
                ps[lca[prs[i].F][prs[i].S]] -= 2;
            }
        }
        ll v = dfs_ps(0, 0);
        ans += v * (__builtin_popcount(b) % 2 ? -1 : 1);
    }
    cout << ans << '\n';

}

// -----------------------------------------------------------------------

int main() {
    ios_base::sync_with_stdio(false), cin.tie(0), cout.tie(0);
    cout << fixed << setprecision(10);
    sss << R"(
8
1 2
2 3
4 3
2 5
6 3
6 7
8 6
5
2 7
3 5
1 6
2 8
7 8
    )";
    MAIN();
    return 0;
}


Measured memory_bytes: 256