#include <vector>
#include <map>
#include <set>
#include <queue>
#include <algorithm>
#include <numeric>
#include <sstream>
#include <iostream>
#include <iomanip>
#define _USE_MATH_DEFINES
#include <cmath>
#include <climits>
#include <cstdlib>
#include <cstring>
#include <cfloat>
#include <cmath>
#include <ctime>
#include <cassert>
#include <cctype>
#include <cstdio>
#include <cassert>
using namespace std;

#define EPS 1e-12
#define ull unsigned long long
#define ll long long
#define VI vector<ll>
#define PII pair<ll, ll> 
#define VVI vector<vector<ll> >
#define VVVI vector<vector<vector<ll>>>
#define VVVVI vector<vector<vector<vector<ll>>>>
#define REP(i,n) for(ll i=0,_n=(n);(i)<(ll)_n;++i)
#define REPR(i,n) for(ll i=(ll)(n)-1;0<=(i);--i)
#define RANGE(i,a,b) for(ll i=(ll)a,_b=(ll)(b);(i)<_b;++i)
#define RANGER(i,a,b) for(ll i=(ll)(b)-1,_a=(ll)(a);(_a)<=i;--i)
#define FOR(i,c) for(__typeof((c).begin())i=(c).begin();i!=(c).end();++i)
#define ALL(c) (c).begin(), (c).end()
#define ALLR(c) (c).rbegin(), (c).rend()
#define PB push_back
#define MP(a, b) make_pair(a, b)
#define POPCOUNT __builtin_popcount
#define POPCOUNTLL __builtin_popcountll
#define CLEAR(table, v) memset(table, v, sizeof(table));
#define UNIFORM_DOUBLE(a, b) (((b-a)*(double)rand()/RAND_MAX)+a) // [a, b) 
#define UNIFORM_LL(a, b) (ll)UNIFORM_DOUBLE(a, b) // [a, b) 
#define IN(v, lo, hi) ((lo)<=(v) && (v)<(hi))
#define DD(v) cout<<#v<<": "<<v<<endl
#define FI first
#define SE second
template <typename T0, typename T1> std::ostream& operator<<(std::ostream& os, const pair<T0, T1>& v) { os << v.first << ": " << v.second << " "; return os; }
template <typename T0, typename T1> std::ostream& operator<<(std::ostream& os, const map<T0, T1>& v) { for( typename map<T0, T1>::const_iterator p = v.begin(); p!=v.end(); p++ ){os << p->first << ": " << p->second << " ";} return os; }
template <typename T> std::ostream& operator<<(std::ostream& os, const vector<T>& v) { for( int i = 0; i < (int)v.size(); i++ ) { os << v[i] << " "; } return os; }
template <typename T> std::ostream& operator<<(std::ostream& os, const set<T>& v) { vector<T> tmp(v.begin(), v.end()); os << tmp; return os; }
template <typename T> std::ostream& operator<<(std::ostream& os, const deque<T>& v) { vector<T> tmp(v.begin(), v.end()); os << tmp; return os; }
template <typename T> std::ostream& operator<<(std::ostream& os, const vector<vector<T> >& v) { for( int i = 0; i < (int)v.size(); i++ ) { os << v[i] << endl; } return os; }
template<typename T>void maxUpdate(T& a, T b) {a = max(a, b);}
template<typename T>void minUpdate(T& a, T b) {a = min(a, b);}

#define MOD 1000000007LL
#define INF (1LL<<60)

void dfs(ll prev, ll cur, VVI& g, VI& parent) {
	ll N = g.size();
	REP(i, g[cur].size()) if(prev!=g[cur][i]) {
		parent[g[cur][i]] = cur;
		dfs(cur, g[cur][i], g, parent);
	}
}

int main() {
	cin.tie(0);
	ios::sync_with_stdio(false);
	ll N, M;
	while(cin>>N) {
		VVI g(N);
		map<PII, ll> ei;
		REP(i, N-1) {
			ll a, b;
			cin>>a>>b;
			a--;b--;
			g[a].PB(b);
			g[b].PB(a);
			ei[MP(a, b)] = i;
			ei[MP(b, a)] = i;
		}
		VI parent(N, -1);
		dfs(-1, 0, g, parent);
//		DD(parent);
//		DD(ei);
		cin>>M;
		vector<vector<bool>> pat(M, vector<bool>(N-1));
		REP(i, M) {
			ll u, v;
			cin>>u>>v;
			u--;v--;
			VVI paths;
			for(ll x: vector<ll>{u, v}) {
				VI path;
				path.PB(x);
				while(parent[x]!=-1) {
					path.PB(parent[x]);
					x = parent[x];
				}
				paths.PB(path);
			}
			ll com = 0;
			REP(i, min(paths[0].size(), paths[1].size())) {
				if(paths[0][paths[0].size()-1-i]==paths[1][paths[1].size()-1-i]) {
					com = i;
				}
			}
			REP(k, 2) REP(j, paths[k].size()-1-com) {
				pat[i][ei[MP(paths[k][j], paths[k][j+1])]] = 1;
			}
		}
//		REP(i, M) DD(pat[i]);
		ll no = 0;
		RANGE(bi, 1, 1<<M) {
			vector<bool> pa(N-1);
			REP(i, M) if(bi>>i&1) REP(j, N-1) pa[j] = pa[j] | pat[i][j];
//			DD(bi);DD(pa);
			ll co = 1;
			REP(i, N-1) if(!pa[i]) co*=2;
			ll sign = (POPCOUNTLL(bi) % 2 == 1) ? 1 : -1;
//			DD(co);DD(sign);
			no += sign * co;
		}
		ll ans = (1LL<<(N-1)) - no;
		
		cout<<ans<<endl;
//		break;
	}
	
	return 0;
}


Measured memory_bytes: 384