#include <bits/stdc++.h>
using namespace std;

using i64 = int64_t;

#define rep(i, x, y) for (i64 i = i64(x), i##_max_for_repmacro = i64(y); i < i##_max_for_repmacro; ++i)
#define debug(x) #x << "=" << (x)

#ifdef DEBUG
#define _GLIBCXX_DEBUG
#define print(x) std::cerr << debug(x) << " (L:" << __LINE__ << ")" << std::endl
#else
#define print(x)
#endif

template <i64 p>
class fp {
    public:
    i64 x;
    fp() : x(0) {}
    fp(i64 x_) : x((x_ % p + p) % p) {}
    fp operator+() const { return fp(x); }
    fp operator-() const { return fp(-x); }
    fp& operator+=(const fp& y) {
        x += y.x;
        if (x >= p) x -= p;
        return *this;
    }
    fp& operator-=(const fp& y) { return *this += -y; }
    fp& operator*=(const fp& y) {
        x = x * y.x % p;
        return *this;
    }
    fp& operator/=(const fp& y) { return *this *= fp(inverse(y.x)); }
    fp operator+(const fp& y) const { return fp(x) += y; }
    fp operator-(const fp& y) const { return fp(x) -= y; }
    fp operator*(const fp& y) const { return fp(x) *= y; }
    fp operator/(const fp& y) const { return fp(x) /= y; }
    bool operator==(const fp& y) const { return x == y.x; }
    bool operator!=(const fp& y) const { return !(*this == y); }
    i64 extgcd(i64 a, i64 b, i64& x, i64& y) {
        i64 d = a;
        if (b != 0) {
            d = extgcd(b, a % b, y, x);
            y -= (a / b) * x;
        } else {
            x = 1;
            y = 0;
        }
        return d;
    }
    i64 inverse(i64 a) {
        i64 x, y;
        extgcd(a, p, x, y);
        return (x % p + p) % p;
    }
};

template <i64 p>
i64 abs(const fp<p>& x) { return x.x; }

template <i64 p>
istream& operator>>(istream& is, fp<p>& x) {
    is >> x.x;
    return is;
}

template <i64 p>
ostream& operator<<(ostream& os, const fp<p>& x) {
    os << x.x;
    return os;
}

template <typename T, typename U>
ostream& operator<<(ostream& os, const pair<T, U>& p) {
    os << "(" << p.first << ", " << p.second << ")";
    return os;
}

template <typename T>
ostream& operator<<(ostream& os, const vector<T>& vec) {
    os << "[";
    for (const auto& v : vec) {
        os << v << ",";
    }
    os << "]";
    return os;
}

template <typename T>
bool chmin(T& a, const T& b) {
    if (a > b) {
        a = b;
        return true;
    }
    return false;
}

template <typename T>
bool chmax(T& a, const T& b) {
    if (a < b) {
        a = b;
        return true;
    }
    return false;
}

template <typename A, typename T, size_t size>
void fill(A (&ary)[size], const T& val) {
    fill((T*)ary, (T*)(ary + size), val);
}

// x未満の要素の個数を返す
template <typename T>
i64 count_less(const vector<T>& v, T x) {
    return lower_bound(begin(v), end(v), x) - begin(v);
}

// x以下の要素の個数を返す
template <typename T>
i64 count_less_or_equal(const vector<T>& v, T x) {
    return upper_bound(begin(v), end(v), x) - begin(v);
}

// xより大きい要素の個数を返す
template <typename T>
i64 count_greater(const vector<T>& v, T x) {
    return end(v) - upper_bound(begin(v), end(v), x);
}

// x以上の要素の個数を返す
template <typename T>
i64 count_greater_or_equal(const vector<T>& v, T x) {
    return end(v) - lower_bound(begin(v), end(v), x);
}

// x未満の要素のうち最大のものを返す
template <typename T>
T max_less(const vector<T>& v, T x) {
    return *(lower_bound(begin(v), end(v), x) - 1);
}

// x以下の要素のうち最大のものを返す
template <typename T>
T max_less_or_equal(const vector<T>& v, T x) {
    return *(upper_bound(begin(v), end(v), x) - 1);
}

// xより大きい要素のうち最小のものを返す
template <typename T>
T min_greater(const vector<T>& v, T x) {
    return *upper_bound(begin(v), end(v), x);
}

// x以上の要素のうち最小のものを返す
template <typename T>
T min_greater_or_equal(const vector<T>& v, T x) {
    return *lower_bound(begin(v), end(v), x);
}

constexpr int inf = 1.01e9;
constexpr i64 inf64 = 4.01e18;
constexpr long double eps = 1e-9;

// 実数値のn分探索のループ回数の上限(2分探索なら50でも十分かもしれない)
constexpr i64 max_loop = 100;

long double tolerance(const long double& a, const long double& b, const long double& epsilon = eps) {
    return epsilon * max({1.l, abs(a), abs(b)});
}

// a<0なら-1, a==0なら0, a>0なら1
int sgn(const long double a, const long double& epsilon = eps) {
    return (a > epsilon) - (a < -epsilon);
}

// a<bなら-1, a==bなら0, a>bなら1
int compare(const long double& a, const long double& b, const long double& epsilon = eps, bool is_relative = true) {
    return sgn(a - b, is_relative ? tolerance(a, b, epsilon) : epsilon);
}

// a==bか?
bool is_equal(const long double& a, const long double& b, const long double& epsilon = eps, bool is_relative = true) {
    return compare(a, b, epsilon, is_relative) == 0;
}

// a<bか?
bool is_less(const long double& a, const long double& b, const long double& epsilon = eps, bool is_relative = true) {
    return compare(a, b, epsilon, is_relative) == -1;
}

// a<=bか?
bool is_less_or_equal(const long double& a, const long double& b, const long double& epsilon = eps, bool is_relative = true) {
    return compare(a, b, epsilon, is_relative) <= 0;
}

// a>bか?
bool is_greater(const long double& a, const long double& b, const long double& epsilon = eps, bool is_relative = true) {
    return compare(a, b, epsilon, is_relative) == 1;
}

// a>=bか?
bool is_greater_or_equal(const long double& a, const long double& b, const long double& epsilon = eps, bool is_relative = true) {
    return compare(a, b, epsilon, is_relative) >= 0;
}

class lca_solver {
public:
    vector<vector<int>> chldren;  // chldren[i] = 頂点iの子のリスト(ただし親を含んでいる場合でも正常に動く)
    int root;
    // if root,parent is -1.
    vector<int> parent;
    vector<int> depth;
    vector<vector<int>> parent_pow2;
    lca_solver(vector<vector<int>> &children_, int root_)
            : chldren(children_), root(root_) {
        calc_parent_and_depth();
        calc_parent_pow2();
    };
    int lca(int u, int v) {
        // make sure depth(u) > depth(v).
        if (depth[u] < depth[v]) swap(u, v);
        for (size_t k = 0; k < parent_pow2.size(); k++) {
            if (((depth[u] - depth[v]) >> k) & 1) {
                u = parent_pow2[k][u];
            }
        }
        if (u == v) return u;
        for (int k = (int)parent_pow2.size() - 1; k >= 0; k--) {
            if (parent_pow2[k][u] != parent_pow2[k][v]) {
                u = parent_pow2[k][u];
                v = parent_pow2[k][v];
            }
        }
        return parent_pow2[0][u];
    }
    int dist(int u, int v) {
        return depth[u] + depth[v] - depth[lca(u, v)] * 2;
    }

private:
    void calc_parent_and_depth() {
        parent = vector<int>(chldren.size(), -1);
        depth = vector<int>(chldren.size(), -1);
        sub_calc_parent_and_depth(root, -1, 0);
    }
    void sub_calc_parent_and_depth(int cur, int par, int dep) {
        parent[cur] = par;
        depth[cur] = dep;
        for (int child : chldren[cur]) {
            if (child != par) {
                sub_calc_parent_and_depth(child, cur, dep + 1);
            }
        }
    }
    void calc_parent_pow2() {
        // parent_pow2[k][i] = 2^k parent of node i.
        parent_pow2 = vector<vector<int>>(ceil(log(chldren.size()) / log(2) + 1),
                                          vector<int>(chldren.size(), -1));
        parent_pow2[0] = parent;
        for (size_t k = 0; k + 1 < parent_pow2.size(); k++) {
            for (size_t v = 0; v < chldren.size(); v++) {
                if (parent_pow2[k][v] >= 0) {
                    parent_pow2[k + 1][v] = parent_pow2[k][parent_pow2[k][v]];
                }
            }
        }
    }
};

void solve() {
    //constexpr i64 mod = 1'000'000'007;
    i64 N;
    cin >> N;
    vector<vector<int>> tree(N);
    rep(i,0,N-1){
        i64 a,b;
        cin >> a >> b;
        --a;
        --b;
        tree[a].emplace_back(b);
        tree[b].emplace_back(a);
    }

    i64 M;
    cin >> M;
    vector<i64> us(M),vs(M);
    rep(i,0,M){
        cin >> us[i] >> vs[i];
        --us[i];
        --vs[i];
    }

    lca_solver ls(tree,0);
    vector<i64> lca(M);
    rep(i,0,M){
        lca[i]=ls.lca(us[i],vs[i]);
    }

    i64 comp=0;
    rep(i,1,1<<M){
        vector<i64> cnt(N);
        rep(j,0,M){
            if(i&(1<<j)){
                ++cnt[us[j]];
                ++cnt[vs[j]];
                cnt[lca[j]]-=2;
            }
        }

        i64 white=0;
        function<i64(i64,i64)> dfs=[&](i64 u, i64 p){
            i64 sum=0;
            for(auto v:tree[u]){
                if(v==p) continue;
                i64 tmp=dfs(v,u);
                if(tmp>0) ++white;
                sum+=tmp;
            }
            sum+=cnt[u];
            return sum;
        };
        dfs(0,-1);

        i64 pow=1;
        rep(j,0,N-1-white) pow*=2;
        if(__builtin_popcountll(i)%2==1) comp+=pow;
        else comp-=pow;
    }

    i64 ans=1;
    rep(i,0,N-1) ans*=2;
    ans-=comp;

    cout << ans << endl;
}

int main() {
    std::cin.tie(0);
    std::ios::sync_with_stdio(false);
    cout.setf(ios::fixed);
    cout.precision(16);
    solve();
    return 0;
}


Measured memory_bytes: 512