#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <cstring>
#include <cmath>
#include <limits>
#include <stack>
#include <queue>
#include <map>
#include <set>
#include <functional>
#include <iomanip>

using namespace std;

#ifdef LOCAL
#define eprintf(...) fprintf(stderr, __VA_ARGS__)
#else
#define eprintf(...) 42
#endif
using ll = long long;
using vll = std::vector<ll>;
using vvll = std::vector<vll>;
using vvvll = std::vector<vvll>;
#define reps(i, S, E) for (ll i = (S); i <= (E); i++)
#define rep(i, N) reps(i, 0, N-1)
#define deps(i, E, S) for (ll i = (E); i >= (S); i--)
#define dep(i, N) deps(i, N-1, 0)
const ll INF = 1LL << 60;
const int INF_INT = 1 << 30;

template<class T> inline bool chmax(T &a, T b) { if (a < b) { a = b; return true; }return false; }
template<class T> inline bool chmin(T &a, T b) { if (a > b) { a = b; return true; }return false; }
#define CEIL(x, y) ((x + y - 1) / (y))
struct mll {
	static ll MOD;
	ll val;
	mll(ll v = 0) : val(v % MOD) { if (val < 0) val += MOD; }
	mll operator - () const { return -val; }
	mll operator + (const mll &b) const { return val + b.val; }
	mll operator - (const mll &b) const { return val - b.val; }
	mll operator * (const mll &b) const { return val * b.val; }
	mll operator / (const mll &b) const { return mll(*this) /= b; }
	mll operator + (ll b) const { return *this + mll(b); }
	mll operator - (ll b) const { return *this - mll(b); }
	mll operator * (ll b) const { return *this * mll(b); }
	friend mll operator + (ll a, const mll &b) { return b + a; }
	friend mll operator - (ll a, const mll &b) { return -b + a; }
	friend mll operator * (ll a, const mll &b) { return b * a; }
	mll &operator += (const mll &b) { val = (val + b.val) % MOD; return *this; }
	mll &operator -= (const mll &b) { val = (val + MOD - b.val) % MOD; return *this; }
	mll &operator *= (const mll &b) { val = (val*b.val) % MOD; return *this; }
	mll &operator /= (const mll &b) {
		ll c = b.val, d = MOD, u = 1, v = 0;
		while (d) {
			ll t = c / d;
			c -= t * d; swap(c, d);
			u -= t * v; swap(u, v);
		}
		val = val * u % MOD;
		if (val < 0) val += MOD;
		return *this;
	}
	mll &operator += (ll b) { return *this += mll(b); }
	mll &operator -= (ll b) { return *this -= mll(b); }
	mll &operator *= (ll b) { return *this *= mll(b); }
	mll &operator /= (ll b) { return *this /= mll(b); }
	bool operator == (const mll &b) { return val == b.val; }
	bool operator != (const mll &b) { return val != b.val; }
	bool operator == (ll b) { return *this == mll(b); }
	bool operator != (ll b) { return *this != mll(b); }
	friend bool operator == (ll a, const mll &b) { return mll(a) == b.val; }
	friend bool operator != (ll a, const mll &b) { return mll(a) != b.val; }
	friend ostream &operator << (ostream &os, const mll &a) { return os << a.val; }
	friend istream &operator >> (istream &is, mll &a) { return is >> a.val; }
	static mll Combination(ll a, ll b) {
		chmin(b, a - b);
		if (b < 0) return mll(0);
		mll c = 1;
		rep(i, b) c *= a - i;
		rep(i, b) c /= i + 1;
		return c;
	}
};
using vmll = std::vector<mll>;
using vvmll = std::vector<vmll>;
using vvvmll = std::vector<vvmll>;
using vvvvmll = std::vector<vvvmll>;

struct Fast {
	Fast() {
		cin.tie(0);
		ios::sync_with_stdio(false);
		cout << fixed << setprecision(std::numeric_limits<double>::max_digits10);
	}
} fast; //cin,cout高速化のおまじない＋桁数指定

ll mll::MOD = (ll)(1e9 + 7);// 998244353ll;


ll edgeGroup(ll N, vvll g, map<pair<ll, ll>, ll> mp, ll u, ll v) {
	vll dist(N, -1);
	queue<ll> q;
	dist[u] = 0;
	q.push(u);

	while (q.empty() == false) {
		auto curr = q.front();
		q.pop();

		for (auto next : g[curr]) {
			if (dist[next] >= 0) {
				continue;
			}

			dist[next] = dist[curr] + 1;
			q.push(next);

			//目的地を発見したのでこれで終わり
			if (next == v) {
				while (q.empty() == false) {
					q.pop();
				}
				break;
			}
		}
	}

	ll ans = 0;
	ll d = dist[v] - 1;
	ll curr = v;
	while (d >= 0) {
		for (auto next : g[curr]) {
			if (dist[next] == d) { //次のノード発見
				ll bit = 1ll << mp[make_pair(curr, next)];
				ans |= bit;
				curr = next;
				d--;
				break;
			}
		}
	}

	return ans;
}

ll bitCount(ll n) {
	ll ans = 0;
	while (n > 0) {
		if ((n & 1ll) > 0) {
			ans++;
		}
		n >>= 1ll;
	}
	return ans;
}

void solve() {
	ll N;
	cin >> N;
	vector<vector<ll>> g(N, vector<ll>(0));
	map<pair<ll, ll>, ll> mp;
	rep(i, N - 1) {
		ll a;
		cin >> a;
		ll b;
		cin >> b;
		a--;
		b--;
		g[a].push_back(b);
		g[b].push_back(a);
		mp[make_pair(a, b)] = i; //辺No
		mp[make_pair(b, a)] = i; //辺No
	}

	ll M;
	cin >> M;
	vector<ll> u(M);
	vector<ll> v(M);
	rep(i, M) {
		cin >> u[i] >> v[i];
		u[i]--;
		v[i]--;
	}

	//制約それぞれについて、頂点間に含まれる辺の集合を作成する
	vll seiyaku(M, 0);
	rep(i, M) {
		seiyaku[i] = edgeGroup(N, g, mp, u[i], v[i]);
	}

	ll notPat = 0;
	//vector<bool> bit(M); //制約数
	reps(i, 1, (1ll << M) - 1) { //制約のON/OFFをbitで管理
		ll bit_count = 0;
		ll edges = 0;

		rep(j, M) {
			if ((i & (1ll << j)) != 0ll) {
				//bit[j] = true;
				//制約[j]を使う
				edges |= seiyaku[j];
				bit_count++;
			}
			else {
				//bit[j] = false;
			}
		}

		//制約のOR結合したもの"以外の辺の数"を計上
		ll edge_num = N - 1 - bitCount(edges);

		//制約のOR結合した辺についてはすべて白(1パタン)×2^(その他の辺の数)
		ll pat = 1ll << edge_num;

		//包除原理
		if (bit_count % 2 == 0) {
			//引く
			notPat -= pat;
		}
		else {
			//足す
			notPat += pat;
		}
	}

	ll result = (1ll << (N - 1)) - notPat; //すべての白黒パタン数 - 制約を満たさないパタン数

	cout << result << endl;
}

int main() {
#if TEST && LOCAL
	ll t; cin >> t;
	rep(i, t) { solve(); }
#else
	solve();
#endif
	return 0;
}

Measured memory_bytes: 3600