#include <iostream>
#include <string>
#include <vector>
#include <set>
#include <stack>
#include <queue>
#include <map>
#include <algorithm>
#include <iomanip>
#include <math.h>
#include <string.h>
#include <cstdio>
#include <tuple>
using namespace std; using ll = long long; using ld = long double;  using pll = pair<ll, ll>;
using vl = vector<ll>; using vll = vector<vl>; using vpll = vector<pll>;
const ld PI = 3.1415926535897932;
#define debug(...) cerr << "[" << #__VA_ARGS__ << "]:", debug_out(__VA_ARGS__)
#define rep1(n) for(ll i=0;i<n;++i)
#define rep2(i,n) for(ll i=0;i<n;++i)
#define rep3(i,a,b) for(ll i=a;i<b;++i)
#define rep4(i,a,b,c) for(ll i=a;i<b;i+=c)
#define rep(...) overload4(__VA_ARGS__,rep4,rep3,rep2,rep1)(__VA_ARGS__)
#define mp make_pair
#define mt make_tuple
#define INT(...) int __VA_ARGS__;in(__VA_ARGS__)
#define LL(...) ll __VA_ARGS__;in(__VA_ARGS__)
#define ULL(...) ull __VA_ARGS__;in(__VA_ARGS__)
#define STR(...) string __VA_ARGS__;in(__VA_ARGS__)
#define CHR(...) char __VA_ARGS__;in(__VA_ARGS__)
#define DBL(...) double __VA_ARGS__;in(__VA_ARGS__)
#define LD(...) ld __VA_ARGS__;in(__VA_ARGS__)
void in() {}
void debug_out() { cerr << endl; }
template<typename Head, typename... Tail>
void debug_out(Head h, Tail... t) {
	cerr << " " << h;
	if (sizeof...(t) > 0) cerr << " :";
	debug_out(t...);
}
template <typename T>
ostream& operator<<(ostream& os, vector<T> vec) {
	for (size_t i = 0; i < vec.size(); i++)os << vec[i] << (i + 1 == vec.size() ? "" : " ");
	return os;
}
ll ctoi(char c) {
	switch (c) {
	case '0': return 0; case '1': return 1; case '2': return 2;
	case '3': return 3; case '4': return 4; case '5': return 5;
	case '6': return 6; case '7': return 7; case '8': return 8;
	case '9': return 9;  default: return 0;
	}
}
bool pairCompare(const pll firstElof, pll secondElof)
{
	return firstElof.first > secondElof.first;
}
//**Snippetリスト**//
//rep, vin, all, iteLoop//
//bitSearch, bitList, nod, gcdlcm, isPrime, primeFactorize, Npow, divisor, modinv, dfs, bfs, eratos//
//dijkstra, WarshallFloyd, BellmanFord, UnionFind, COM, digitDP ,RMQ//
ll i, j, k, l; ll N, M, K, H, W, L, X, Y, Z, R, Q;
ll MOD = 1000000007; ll INF = 1LL << 60; ll ans = 0; ll z = 0, o = 1;
vl flag, D; vll path;
//***********//
ll Npow(ll x, ll n) {
	if (n == 0) return 1;
	if (n % 2 == 0) return Npow(x * x % MOD, n / 2);
	else return x * Npow(x, n - 1) % MOD;
}

vl bitList(ll n, ll k, ll f) {
	vl bitList(k);
	for (ll i = 0; i < k; i++) {
		bitList[i] = f % n;
		f /= n;
	}
	return bitList;
}
void warshall_floyd(int n) {
	for (int k = 0; k < n; k++) {
		for (int i = 0; i < n; i++) {
			for (int j = 0; j < n; j++) {
				path[i][j] = min(path[i][j], path[i][k] + path[k][j]);
			}
		}
	}
}
int main() {
	cin >> N;
	path.resize(N);
	for (i = 0; i < N; i++) {
		for (j = 0; j < N; j++) {
			path[i].push_back(INF);
			if (i == j) path[i][j] = 0;
		}
	}
	D.resize(N);
	vpll V(N - 1);
	
	for (i = 0; i < N-1; i++) {
		ll a, b;
		cin >> a >> b;
		a--; b--;
		path[a][b] = 1;
		path[b][a] = 1;
		V[i] = mp(a, b);
	}
	warshall_floyd(N);
	cin >> M;
	vll P(N - 1, vl(M, 0));
	vl bitP(N - 1);
	for (i = 0; i < M; i++) {
		ll u, v;
		cin >> u >> v;
		u--; v--;
		for (k = 0; k < N-1; k++) {
			//debug(u,V[k].first,V[k].second,v,path[u][V[k].first], path[V[k].second][v], path[u][v]);
			if (path[u][V[k].first] + path[V[k].second][v] == path[u][v] - 1 || path[u][V[k].second] + path[V[k].first][v] == path[u][v] - 1) {
				P[k][i] = 1;
				bitP[k] += pow(2, i);
			}
			//debug(P[k]);
		}

	}
	vll dp(N, vl(pow(2, M)));
	for (i = 0; i < N; i++) {
		for (j = 0; j < pow(2,M); j++) {
			dp[i][j] = 0;
		}
	}
	dp[0][0] = 1;
	ll L = pow(2, M);
	for (i = 0; i < N-1; i++) {
		for (j = 0; j < L; j++) {
			dp[i + 1][j] += dp[i][j];
			ll pre = j | bitP[i];
			dp[i + 1][pre] += dp[i][j];
		}
	}
	cout << dp[N-1][L - 1];
}

Measured memory_bytes: 418304