#include <bits/stdc++.h>
using namespace std;
#define Rep(i,n) for(int i=0;i<(int)(n);i++)
#define For(i,n1,n2) for(int i=(int)(n1);i<(int)(n2);i++)
#define REP(i,n) for(ll i=0;i<(ll)(n);i++)
#define RREP(i,n) for(ll i=((ll)(n)-1);i>=0;i--)
#define FOR(i,n1,n2) for(ll i=(ll)(n1);i<(ll)(n2);i++)
#define RFOR(i,n1,n2) for(ll i=((ll)(n1)-1);i>=(ll)(n2);i--)
#define all(a)  (a).begin(),(a).end()
#define SORT(a) sort((a).begin(),(a).end())
#define oorret 0
#define oor(x) [&](){try{x;} catch(const out_of_range& oor){return oorret;} return x;}()
#define IOS cin.tie(0),ios::sync_with_stdio(false)
typedef long long ll;
typedef unsigned long long ull;
typedef std::pair<ll, ll> P;
template<typename T1, typename T2> inline bool chmin(T1& a, T2 b) { if (a > b) { a = b; return 1; }return 0; }
template<typename T1, typename T2> inline bool chmax(T1& a, T2 b) { if (a < b) { a = b; return 1; }return 0; }
template<class Type>struct is_vector : std::false_type {};
template<class ValueType, class Alloc>struct is_vector<std::vector<ValueType, Alloc>> : std::true_type {};
template <typename T> inline std::ostream& operator << (std::ostream& out, const std::vector<T>& v) {
	if (v.empty())return out;
	constexpr bool is_vector_v = is_vector<T>::value;
	if (is_vector_v)for (auto itr = v.begin(); itr != v.end();)out << (*itr), out << ((++itr != v.end()) ? "\n" : "");
	else for (auto itr = v.begin(); itr != v.end();)out << (*itr), out << ((++itr != v.end()) ? " " : "");
	return out;
}
inline void put() {}
template<class T> inline void put(const T& first) { std::cout << first << "\n"; }
template<class T, class... N> inline void put(const T& first, const N& ... rest) { std::cout << first << " "; put(rest...); }
inline void putn() {}
template<class T, class... N> inline void putn(const T& first, const N& ... rest) { std::cout << first << "\n"; putn(rest...); }

set<ll> paths(vector<vector<P>>& path, ll a, ll b) {
	set<ll> res;
	ll n = path.size();
	vector<P> d(n,P(-1,-1));
	queue<ll> q;
	q.push(a);
	d[a] = P(0, -1);
	while (!q.empty()) {
		ll p = q.front();
		q.pop();
		REP(i, path[p].size()) {
			ll t = path[p][i].first;
			if (d[t].first < 0) {
				d[t] = P(path[p][i].second, p);
				q.push(t);
			}
		}
	}
	ll tmp = b;
	while (tmp != a) {
		res.insert(d[tmp].first);
		tmp = d[tmp].second;
	}
	//res.insert(a);
	return res;
}

vector<int> demical(ll n, int k, int l = -1) {
	vector<int> rtn;
	if (l < 0) {
		while (n > 0) {
			rtn.push_back(n % k);
		}
	} else {
		rtn.resize(l);
		REP(i, l) {
			rtn[i] = n % k;
			n /= k;
		}
	}
	return rtn;
}

template<typename T, typename U>
inline T pow(T x, U exp) {
	if (exp <= 0) {
		return 1;
	}
	if (exp % 2 == 0) {
		T d = pow(x, exp / 2);
		return d * d;
	} else {
		return (x * pow(x, exp - 1));
	}
}

int main() {
	IOS;
	ll n;
	cin >> n;
	
	vector<ll> a(n - 1), b(n - 1);
	vector<vector<P>> path(n);
	vector<set<ll>> pps(n);
	
	ll cnt = 0;
	REP(i, n - 1) {
		cin >> a[i] >> b[i];
		a[i]--;
		b[i]--;
		path[a[i]].push_back(P(b[i],cnt));
		path[b[i]].push_back(P(a[i],cnt));
		cnt++;
	}
	ll m;
	cin >> m;
	vector<ll> u(m), v(m);
	REP(i, m) {
		cin >> u[i] >> v[i];
		u[i]--;
		v[i]--;
	}

	vector<ll> d(n, 0);
	queue<ll> q;
	q.push(0);
	d[0] = 1;
	while (!q.empty()) {
		ll p = q.front();
		q.pop();
		REP(i, path[p].size()) {
			ll t = path[p][i].first;
			if (d[t] == 0) {
				d[t] = 1;
				for (auto v : pps[p]) {
					pps[t].insert(v);
				}
				pps[t].insert(path[p][i].second);
				q.push(t);
			}
		}
	}

	vector<bitset<100>> ps(m);
	REP(i, m) {
		set<ll> tmp;
		for (auto v : pps[u[i]]) {
			ps[i][v] = !ps[i][v];
			
		}
		for (auto vv : pps[v[i]]) {
			ps[i][vv] = !ps[i][vv];
		}
	}
	ll l = 1ll << m;
	
	ll res = 1ll<<(n-1);
	ll tmp = 0;
	bitset<100> bs;
	
	FOR(i, 1 , l) {
		auto d = demical(i, 2, m);
		int c = 0;
		REP(j, m) {
			c += d[j];
		}
		ll t = n - 1;
		bitset<100> s;
		REP(j, m) {
			if (d[j] % 2 == 1) {
				s |= ps[j];
			}
		}
		t -= s.count();
		ll t2 = 1ll << t;
		if (c % 2 == 0) {
			tmp -= t2;
		} else {
			tmp += t2;
		}
	}
	put(res - tmp);
	return 0;
}


Measured memory_bytes: 384