#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
 
#define ALL(obj) (obj).begin(),(obj).end()
#define SPEED cin.tie(0);ios::sync_with_stdio(false);
 
template<class T> using PQ = priority_queue<T>;
template<class T> using PQR = priority_queue<T,vector<T>,greater<T>>;
 
constexpr long long MOD = (long long)1e9 + 7;
constexpr long long MOD2 = 998244353;
constexpr long long HIGHINF = (long long)1e18;
constexpr long long LOWINF = (long long)1e15;
constexpr long double PI = 3.1415926535897932384626433;
 
template <class T> vector<T> multivector(size_t N,T init){return vector<T>(N,init);}
template <class... T> auto multivector(size_t N,T... t){return vector<decltype(multivector(t...))>(N,multivector(t...));}
template <class T> void corner(bool flg, T hoge) {if (flg) {cout << hoge << endl; exit(0);}}
template <class T, class U>ostream &operator<<(ostream &o, const map<T, U>&obj) {o << "{"; for (auto &x : obj) o << " {" << x.first << " : " << x.second << "}" << ","; o << " }"; return o;}
template <class T>ostream &operator<<(ostream &o, const set<T>&obj) {o << "{"; for (auto itr = obj.begin(); itr != obj.end(); ++itr) o << (itr != obj.begin() ? ", " : "") << *itr; o << "}"; return o;}
template <class T>ostream &operator<<(ostream &o, const multiset<T>&obj) {o << "{"; for (auto itr = obj.begin(); itr != obj.end(); ++itr) o << (itr != obj.begin() ? ", " : "") << *itr; o << "}"; return o;}
template <class T>ostream &operator<<(ostream &o, const vector<T>&obj) {o << "{"; for (int i = 0; i < (int)obj.size(); ++i)o << (i > 0 ? ", " : "") << obj[i]; o << "}"; return o;}
template <class T, class U>ostream &operator<<(ostream &o, const pair<T, U>&obj) {o << "{" << obj.first << ", " << obj.second << "}"; return o;}
void print(void) {cout << endl;}
template <class Head> void print(Head&& head) {cout << head;print();}
template <class Head, class... Tail> void print(Head&& head, Tail&&... tail) {cout << head << " ";print(forward<Tail>(tail)...);}
template <class T> void chmax(T& a, const T b){a=max(a,b);}
template <class T> void chmin(T& a, const T b){a=min(a,b);}
void YN(bool flg) {cout << (flg ? "YES" : "NO") << endl;}
void Yn(bool flg) {cout << (flg ? "Yes" : "No") << endl;}
void yn(bool flg) {cout << (flg ? "yes" : "no") << endl;}

//Digit Sum
long long DigitSum(long long N, long long K) {
    long long sum = 0;
    for (; N > 0; N /= K) sum += N % K;
    return sum;
}

int main() {
	SPEED
	ll N; cin >> N;
	vector<ll> pow2(60,1);
	for(int i = 1; i < 60; ++i) pow2[i] = pow2[i-1]*2;
	auto edge = multivector(N,N,1234567LL);
	map<pair<int,int>,int> mp;
	for(int i = 0; i < N-1; ++i){
		int a,b; cin >> a >> b;
		a--,b--;
		edge[a][b] = edge[b][a] = 1;
		mp[{a,b}] = mp[{b,a}] = i;
	}
	for(int i = 0; i < N; ++i) edge[i][i] = 0;
	for(int k = 0; k < N; ++k) for(int i = 0; i < N; ++i)for(int j = 0; j < N; ++j) chmin(edge[i][j],edge[i][k]+edge[k][j]);
	int M; cin >> M;
	vector<int> u(M),v(M);
	for(int i = 0; i < M; ++i) {
		cin >> u[i] >> v[i];
		u[i]--;
		v[i]--;
	}
	vector<ll> vst(M,0);
	for(int i = 0; i < M; ++i) {
		for(auto& e:mp){
			if(edge[u[i]][e.first.first] + edge[e.first.first][e.first.second] + edge[e.first.second][v[i]] == edge[u[i]][v[i]]) vst[i] ^= (1LL<<e.second);
		}
	}
	ll ans = 0;
	for(int i = 0; i < (1<<M); ++i) {
		ll st = 0;
		for(int j = 0; j < M; ++j){
			if((i>>j)&1) {
				st |= vst[j];
			}
		}
		int K = DigitSum(st,2);
		int L = DigitSum(i,2);
		ans += (L%2?-1LL:1LL)*pow2[N-1-K];
	}
	cout << ans << endl;

    return 0;
}

Measured memory_bytes: 256