#include <iostream>
#include <bits/stdc++.h>

#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>

#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep_r(i, n) for (int i = n - 1; i >= 0; i--)
#define rep1(i, n) for (int i = 1; i <= (int)(n); i++)
//#define REP(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
#define REP(i, n) rep(i, n)
#define all(x) (x).begin(), (x).end()
#define SZ(x) ((ll)(x).size())
#define bit(n) (1LL << (n))
#define UNIQUE(v) v.erase(unique(v.begin(), v.end()), v.end());

#define INF bit(29)
#define pb push_back
#define mod 1000000007

using namespace std;
using uif = uint_fast64_t;
using ll = long long int;
using tTree = __gnu_pbds::tree<ll, __gnu_pbds::null_type, less<ll>, __gnu_pbds::rb_tree_tag, __gnu_pbds::tree_order_statistics_node_update>;

using vec = vector<ll>;
using mat = vector<vec>;

ll dx[4] = {1, 0, -1, 0};
ll dy[4] = {0, 1, 0, -1};

#define FACSIZE 200002

ll invfac[FACSIZE];
ll fac[FACSIZE];

template <class T>
bool chmax(T &, const T &);
template <class T>
bool chmin(T &, const T &);
ll gcd(ll, ll);
ll powLL(ll x, ll y);

ll mod_pow(ll, ll);
ll mod_add(ll, ll);
ll mod_mul(ll, ll);
ll mod_div(ll, ll);
ll comb(ll, ll);
void make_fact(ll);
void make_invfact(ll);
void fact_init();

struct edge
{
    ll to, cost, id;
};

class Graph
{
public:
    ll N;
    vector<vector<edge>> G;

    Graph(ll N) : N(N)
    {
        G = vector<vector<edge>>(N, vector<edge>(0));
    }

    void add_Directed_edge(ll from, ll to, ll cost = 1, ll id = 0)
    {
        G[from].push_back(edge({to, cost, id}));
    }

    void add_Undirected_edge(ll v1, ll v2, ll cost = 1, ll id = 0)
    {
        add_Directed_edge(v1, v2, cost, id);
        add_Directed_edge(v2, v1, cost, id);
    }

    mat waeshall_floyd()
    {
        mat d(N, vec(N, INF));
        REP(i, N)
        d[i][i] = 0;
        REP(i, N)
        for (edge e : G[i])
        {
            d[i][e.to] = min(d[i][e.to], e.cost);
        }
        REP(k, N)
        REP(i, N)
        REP(j, N)
        d[i][j] = min(d[i][j], d[i][k] + d[k][j]);

        return d;
    }
};

int main(void)
{

    ll n;
    cin >> n;
    Graph G(n);
    rep(i, n - 1)
    {
        ll a, b;
        cin >> a >> b;
        G.add_Undirected_edge(a - 1, b - 1, 1, i);
    }
    mat d = G.waeshall_floyd();
    ll M;
    cin >> M;
    vec use(M, 0);
    REP(i, M)
    {
        ll u, v;
        cin >> u >> v;
        u--;
        v--;
        //cout << u << "," << v << endl;
        ll now = v;
        while (now != u)
        {

            for (auto e : G.G[now])
            {
                //cout << e.to << endl;
                //cout << d[u][e.to] << endl;
                //cout << d[u][now] - 1 << endl;
                if (d[u][e.to] == d[u][now] - 1)
                {
                    now = e.to;
                    use[i] |= bit(e.id);
                    break;
                }
            }
        }
    }

    ll ans = 0;
    REP(k, bit(M))
    {
        ll mask = 0;
        REP(i, M)
        if ((k >> i) & 1)
            mask |= use[i];
        ll tmp = bit(n - 1 - __builtin_popcountll(mask));
        if (__builtin_popcountll(k) % 2)
            ans -= tmp;
        else
            ans += tmp;
    }

    cout << ans << endl;

    return 0;
}

ll mod_pow(ll x, ll r)
{
    if (r == 0)
        return 1;
    else if (r == 1)
        return x % mod;
    else if (r % 2 == 0)
    {
        ll t = mod_pow(x, r / 2) % mod;
        return mod_mul(t, t);
    }
    else
    {
        ll t = mod_pow(x, r / 2) % mod;
        ll k = mod_mul(t, t);
        return (k % mod) * (x % mod);
    }
}
ll mod_add(ll a, ll b)
{
    return ((a % mod) + (b % mod)) % mod;
}

ll mod_mul(ll a, ll b)
{
    return ((a % mod) * (b % mod)) % mod;
}

ll mod_div(ll a, ll b)
{
    return mod_mul(a, mod_pow(b, mod - 2));
}

void fact_init()
{
    make_fact(FACSIZE - 1);
    make_invfact(FACSIZE);
}

void make_fact(ll n)
{
    fac[0] = 1;
    rep(i, n)
    {
        fac[i + 1] = mod_mul(fac[i], i + 1);
    }
}

void make_invfact(ll n)
{
    invfac[n] = mod_pow(fac[n], mod - 2);
    for (int i = n - 1; i >= 0; i--)
    {
        invfac[i] = mod_mul(invfac[i + 1], i + 1);
    }
}

ll comb(ll n, ll r)
{

    return mod_mul(mod_mul(fac[n], invfac[r]), invfac[n - r]);
}
template <class T>
bool chmax(T &a, const T &b)
{
    if (a < b)
    {
        a = b;
        return 1;
    }
    return 0;
}
template <class T>
bool chmin(T &a, const T &b)
{
    if (b < a)
    {
        a = b;
        return 1;
    }
    return 0;
}

ll qp(ll a, ll b)
{
    ll ans = 1LL;
    do
    {
        if (b & 1LL)
            ans = 1LL * mod_mul(ans, a) % mod;
        a = 1LL * mod_mul(a, a) % mod;
    } while (b >>= 1LL);
    return ans;
}
ll qp(ll a, ll b, ll mo)
{
    ll ans = 1LL;
    do
    {
        if (b & 1LL)
            ans = 1LL * (ans % mo) * (a % mo);
        a = 1LL * (a % mo) * (a % mo);
    } while (b >>= 1LL);
    return ans;
}
ll gcd(ll a, ll b)
{
    return b ? gcd(b, a % b) : a;
}
ll powLL(ll x, ll y)
{
    ll ans = 1LL;
    for (ll i = 0LL; i < y; i++)
        ans *= x;
    return ans;
}


Measured memory_bytes: 384