#include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <exception>
#include <fstream>
#include <functional>
#include <iomanip>
#include <ios>
#include <iosfwd>
#include <iostream>
#include <istream>
#include <iterator>
#include <limits>
#include <list>
#include <locale>
#include <map>
#include <memory>
#include <new>
#include <numeric>
#include <ostream>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdexcept>
#include <streambuf>
#include <string>
#include <typeinfo>
#include <utility>
#include <valarray>
#include <vector>
#include <climits>
#include <cstring>

#define rep(i, m, n) for(int i=int(m);i<int(n);i++)
#define all(c) begin(c),end(c)

template<typename T1, typename T2>
inline void chmin(T1 &a, T2 b) { if (a > b) a = b; }

template<typename T1, typename T2>
inline void chmax(T1 &a, T2 b) { if (a < b) a = b; }

typedef long long int ll;
using ll = long long int;
using ull = long long unsigned int;
using Int = long long int;
using namespace std;
#define INF (1 << 30) - 1
#define INFl (ll)5e15
#define DEBUG 0
#define dump(x)  cerr << #x << " = " << (x) << endl
#define MOD 1125899906842624


//edit
class Mint {
    using u64 = std::uint_fast64_t;
    u64 Modulus = MOD;

public:
    u64 a;

    constexpr Mint(const u64 x = 0) noexcept : a(x % Modulus) {}

    constexpr u64 &value() noexcept { return a; }

    constexpr const u64 &value() const noexcept { return a; }

    constexpr Mint operator+(const Mint rhs) const noexcept {
        return Mint(*this) += rhs;
    }

    constexpr Mint operator-(const Mint rhs) const noexcept {
        return Mint(*this) -= rhs;
    }

    constexpr Mint operator*(const Mint rhs) const noexcept {
        return Mint(*this) *= rhs;
    }

    constexpr Mint operator/(const Mint rhs) const noexcept {
        return Mint(*this) /= rhs;
    }

    constexpr Mint &operator+=(const Mint rhs) noexcept {
        a += rhs.a;
        if (a >= Modulus) {
            a -= Modulus;
        }
        return *this;
    }

    constexpr Mint &operator-=(const Mint rhs) noexcept {
        if (a < rhs.a) {
            a += Modulus;
        }
        a -= rhs.a;
        return *this;
    }

    constexpr Mint &operator*=(const Mint rhs) noexcept {
        a = a * rhs.a % Modulus;
        return *this;
    }

    constexpr Mint &operator/=(Mint rhs) noexcept {
        u64 exp = Modulus - 2;
        while (exp) {
            if (exp % 2) {
                *this *= rhs;
            }
            rhs *= rhs;
            exp /= 2;
        }
        return *this;
    }

    constexpr Mint &pow(int rhs) noexcept {
        u64 exp = static_cast<u64>(rhs);
        Mint base(a);
        a = 1;
        while (exp) {
            if (exp % 2) {
                *this *= base;
            }
            base *= base;
            exp /= 2;
        }
        return *this;
    }

};

class Solve {
public:

    vector<vector<Int>> tree;
    vector<vector<Int>> pid; // path_id

    // s to tのパス
    Int dfs(Int s, Int t, Int p = -1) {
        if (s == t) {
            return 0;
        }
        if (p != -1 && tree[s].size() == 1) {
            return -1;
        }

        Int ret = -1;

        for (auto e : tree[s]) {
            if (e != p) {
                Int tmp = dfs(e, t, s);
                if (tmp != -1) {
                    // s to e
                    tmp |= (1ll << pid[s][e]);
                    ret = tmp;
                }
            }
        }

        return ret;
    }

    void solve() {

        Int N;
        cin >> N;
        tree.resize(N);
        pid.resize(N, vector<Int>(N, -1));
        for (int i = 0; i + 1 < N; ++i) {
            int a, b;
            cin >> a >> b;
            a--, b--;
            tree[a].push_back(b);
            tree[b].push_back(a);
            pid[a][b] = pid[b][a] = i;
        }

        Int M;
        cin >> M;
        vector<Int> paths(M);
        for (int i = 0; i < M; ++i) {
            int u, v;
            cin >> u >> v;
            u--, v--;
            paths[i] = dfs(u, v);
            if (paths[i] == -1) {
                exit(-1);
            }
        }

        Mint ans = 0;
        for (int mask = 0; mask < 1ll << M; ++mask) {
            Int use = 0; //今回関係ある
            Int nouse = 0;

            for (int i = 0; i < M; ++i) {
                if (mask >> i & 1) {
                    use |= paths[i];
                }
            }
            nouse = (1ll << (N - 1)) - 1 - use;

            Mint tmp = Mint(2).pow(__pop_count(ull(nouse)));

            if (abs(__pop_count(ull(mask))) % 2 == 0) {
                ans += tmp;
            } else {
                ans -= tmp;
            }
        }

        cout << ans.value() << endl;

    }
};


int main() {
    cin.tie(0);
    ios::sync_with_stdio(false);
    cout << fixed << setprecision(10);

    Solve().solve();


    return 0;
}


Measured memory_bytes: 888