#include<bits/stdc++.h>

#define isz(x) int(x.size())
#define all(x) x.begin(),x.end()
#define ll long long
#define pii pair<int,int>
#define fi first
#define se second
#define isz(x) int(x.size())
#define ull unsigned long long
#define vi vector<int>
#define vll vector<ll>
#define vch vector<char>
#define vvch vector<vch>
#define vvi vector<vector<int>>
#define vvvi vector<vvi>
#define vvll vector<vector<ll>>
#define vpii vector<pair<int,int>>
#define vvpii vector<vpii>
#define forn(i,n) for(int i=0;i<(int)n;++i)
#define pb push_back

int n;

using namespace std;

const int UNDEF = -1;
const int MOD = 1e9 + 7;
const int INF = 1e9;

int main() {

    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    //freopen("input.txt", "rt", stdin);
    //freopen("output.txt", "wt", stdout);

    int N;
    cin >> N;

    vvpii g(1 + N);
    for (int i = 0; i < N-1; ++i) {
        int u, v;
        cin >> u >> v;
        g[u].pb({v,i});
        g[v].pb({u,i});
    }

    int M;
    cin >> M;
    vpii m(M);
    forn(i, M) cin >> m[i].fi >> m[i].se; // путь из fi в se

    vll m_edge(M);
    ll path=0; // путь содержит рёбра (a,b),где a<b
    function<void(int, int, int, int)> dfs = [&](int i, int u, int finish, int p) {
        if (u == finish) {
            m_edge[i]=path;
        }

        for (pii x : g[u]) {
            int to=x.fi;
            int z=x.se;
            if (to == p) continue;
            path|=(1LL<<z);
            dfs(i, to, finish, u);
            path&=~(1LL<<z);
        }
    };

    forn(i, M) dfs(i, m[i].fi, m[i].se, -1); // храню рёбра на пути от fi к se i-ого запроса


    ll bad = 0;
    for (int mask = 1; mask < (1 << M); ++mask) {
        int cnt_1 = 0;
        ll use_edge=0;
        for (int j = 0; j < M; ++j) {
            if (mask & (1 << j)) {
                cnt_1++;
                use_edge|=m_edge[j];
            }
        }

        int cur_pow = (N - 1) - __builtin_popcountll(use_edge);
        if (cnt_1 & 1) bad += (1LL << cur_pow);
        else bad -= (1LL << cur_pow);
    }

    ll all = (1LL << (N - 1));
    cout << all - bad;

    return 0;
}