#include <bits/stdc++.h>
using namespace std;
#ifndef ONLINE_JUDGE
	#include <boost/multiprecision/cpp_int.hpp>
	#include <boost/multiprecision/cpp_dec_float.hpp>
	using bll = boost::multiprecision::cpp_int;
	using bdouble = boost::multiprecision::cpp_dec_float_100;
#endif
#ifdef LOCAL_DEV
	void debug_impl() { std::cerr << std::endl; }
	template<typename Head, typename... Tail> void debug_impl(Head head, Tail... tail) { std::cerr << " " << head << (sizeof...(tail) ? "," : ""); debug_impl(tail...); }
	#define debug(...) { std::cerr << std::boolalpha << "(" << #__VA_ARGS__ << ") ="; debug_impl(__VA_ARGS__); std::cerr << std::noboolalpha; }
#else
	#define debug(...) {}
#endif
#ifdef LOCAL_TEST
	#define BOOST_STACKTRACE_USE_ADDR2LINE
	#define BOOST_STACKTRACE_ADDR2LINE_LOCATION /usr/local/opt/binutils/bin/addr2line
	#define _GNU_SOURCE
	#include <boost/stacktrace.hpp>
	namespace std {
		template<typename T> class dvector : public std::vector<T> {
		public:
			dvector() : std::vector<T>() {}
			explicit dvector(size_t n, const T& value = T()) : std::vector<T>(n, value) {}
			dvector(const std::vector<T>& v) : std::vector<T>(v) {}
			dvector(const std::initializer_list<T> il) : std::vector<T>(il) {}
			dvector(const typename std::vector<T>::iterator first, const typename std::vector<T>::iterator last) : std::vector<T>(first, last) {}
			dvector(const std::string::iterator first, const std::string::iterator last) : std::vector<T>(first, last) {}
			T& operator[](size_t n) {
				try { return this->at(n); } catch (const std::exception& e) {
					std::cerr << boost::stacktrace::stacktrace() << std::endl; return this->at(n);
				}
			}
			const T& operator[](size_t n) const {
				try { return this->at(n); } catch (const std::exception& e) {
					std::cerr << boost::stacktrace::stacktrace() << std::endl; return this->at(n);
				}
			}
		};
	}
	class dbool {
	private:
		bool boolvalue;
	public:
		dbool() : boolvalue(false) {}
		dbool(bool b) : boolvalue(b) {}
		dbool(const dbool &b) : boolvalue(b.boolvalue) {}
		operator bool&() { return boolvalue; }
		operator const bool&() const { return boolvalue; }
	};
	template<typename T> std::ostream& operator<<(std::ostream& s, const dvector<T>& v) {
		for (int i = 0, len = v.size(); i < len; ++i){ s << v[i]; if (i < len - 1) s << "\t"; } return s; }
	template<typename T> std::ostream& operator<<(std::ostream& s, const dvector< dvector<T> >& vv) {
		for (int i = 0, len = vv.size(); i < len; ++i){ s << vv[i] << std::endl; } return s; }
	template<typename T> std::ostream& operator<<(std::ostream& s, const std::set<T>& se) {
		s << "{ "; for (auto itr = se.begin(); itr != se.end(); ++itr){ s << (*itr) << "\t"; } s << "}"; return s; }
	template<typename T> std::ostream& operator<<(std::ostream& s, const std::multiset<T>& se) {
		s << "{ "; for (auto itr = se.begin(); itr != se.end(); ++itr){ s << (*itr) << "\t"; } s << "}"; return s; }
	template<typename T1, typename T2> std::ostream& operator<<(std::ostream& s, const std::map<T1, T2>& m) {
		s << "{" << std::endl; for (auto itr = m.begin(); itr != m.end(); ++itr){ s << "\t" << (*itr).first << " : " << (*itr).second << std::endl; } s << "}"; return s; }
	template<typename T1, typename T2> std::ostream& operator<<(std::ostream& s, const std::pair<T1, T2>& p) { 
		return s << "(" << p.first << ", " << p.second << ")"; }
	#define vector dvector
	#define bool dbool
	class SIGFPE_exception : std::exception {};
	class SIGSEGV_exception : std::exception {};
	void catch_SIGFPE(int e) { std::cerr << boost::stacktrace::stacktrace() << std::endl; throw SIGFPE_exception();	}
	void catch_SIGSEGV(int e) { std::cerr << boost::stacktrace::stacktrace() << std::endl; throw SIGSEGV_exception(); }
	signed convertedmain();
	signed main() { signal(SIGFPE, catch_SIGFPE); signal(SIGSEGV, catch_SIGSEGV); return convertedmain(); }
	#define main() convertedmain()
#endif
//#define int long long
using ll = long long;
//constexpr int INF = 1e9;//INT_MAX=(1<<31)-1=2147483647
constexpr ll INF = (ll)1e18;//(1LL<<63)-1=9223372036854775807
constexpr ll MOD = (ll)1e9 + 7;
constexpr double EPS = 1e-9;
constexpr ll dx[4] = {1LL, 0LL, -1LL, 0LL};
constexpr ll dy[4] = {0LL, 1LL, 0LL, -1LL};
constexpr ll dx8[8] = {1LL, 0LL, -1LL, 0LL, 1LL, 1LL, -1LL, -1LL};
constexpr ll dy8[8] = {0LL, 1LL, 0LL, -1LL, 1LL, -1LL, 1LL, -1LL};
#define rep(i, n)   for(ll i=0, i##_length=(n); i< i##_length; ++i)
#define repeq(i, n) for(ll i=1, i##_length=(n); i<=i##_length; ++i)
#define rrep(i, n)   for(ll i=(n)-1; i>=0; --i)
#define rrepeq(i, n) for(ll i=(n)  ; i>=1; --i)
#define all(v) (v).begin(), (v).end()
#define rall(v) (v).rbegin(), (v).rend()
void p() { std::cout << '\n'; }
template<typename Head, typename... Tail> void p(Head head, Tail... tail) { std::cout << head << (sizeof...(tail) ? " " : ""); p(tail...); }
template<typename T> inline void pv(std::vector<T> &v) { for(ll i=0, N=v.size(); i<N; i++) std::cout << v[i] << " \n"[i==N-1]; }
template<typename T> inline T gcd(T a, T b) { return b ? gcd(b,a%b) : a; }
template<typename T> inline T lcm(T a, T b) { return a / gcd(a,  b) * b; }
template<typename T> inline bool chmax(T &a, T b) { return a < b && (a = b, true); }
template<typename T> inline bool chmin(T &a, T b) { return a > b && (a = b, true); }
template<typename T> inline void uniq(std::vector<T> &v) { v.erase(unique(v.begin(), v.end()), v.end()); }

/*-----8<-----template-----8<-----*/

//区間add, 区間sum ができる
template< typename T >
class BinaryIndexedTree {
public:
	class BinaryIndexedTreeNaive {
	public:
		vector<T> data;
		ll N;

		BinaryIndexedTreeNaive(ll size) : N(size+1) {
			data.assign(N, 0);
		}

		// sum [0, i)
		T sum(ll i) {
			T ret = 0;
			for(--i; i>=0; i=(i&(i+1))-1) ret += data[i];
			return ret;
		}

		// sum [i, j)
		T sum(ll i, ll j) {
			return sum(j) - sum(i);
		}

		// add x to i
		void add(ll i, T x) {
			for(; i < N; i|=i+1) data[i] += x;
		}
	};
	ll size;
	BinaryIndexedTreeNaive b,c;
	BinaryIndexedTree(ll size) : size(size), b(size), c(size) {}

	// add x to [i, j) 
	void add(ll i, ll j, T x) {
		b.add(i,x*-i);
		b.add(j,x*j);
		c.add(i,x);
		c.add(j,x*-1);
	}

	// sum [0, i)
	T sum(ll i) { 
		return b.sum(i+1) + c.sum(i+1)*i;
	}

	// sum [i, j)
	T sum(ll i, ll j) {
		return sum(j) - sum(i);
	}
};
template<typename T> std::ostream& operator<<(std::ostream& s, BinaryIndexedTree<T>& bit) { 
	for(ll i=0; i<bit.size; i++) s << bit.sum(i, i+1) << "\t\n"[i==bit.size-1];
	return s;
}
class HLDecomposition {
private:
	void dfs_sz(ll v) {
		for(ll &u:G[v])
			if(u==par[v]) swap(u,G[v].back());
		if(~par[v]) G[v].pop_back();

		for(ll &u:G[v]){
			par[u]=v;
			dep[u]=dep[v]+1;
			dfs_sz(u);
			sub[v]+=sub[u];
			if(sub[u]>sub[G[v][0]]) swap(u,G[v][0]);
		}
	}

	void dfs_hld(ll v,ll c,ll &pos) {
		vid[v]=pos++;
		inv[vid[v]]=v;
		type[v]=c;
		for(ll u:G[v]){
			if(u==par[v]) continue;
			head[u]=(u==G[v][0]?head[v]:u);
			dfs_hld(u,c,pos);
		}
	}

public:
	ll n;
	vector< vector<ll> > G;
	vector<ll> vid, head, sub, par, dep, inv, type;

	HLDecomposition(ll n):
		n(n),G(n),vid(n,-1),head(n),sub(n,1),
		par(n,-1),dep(n,0),inv(n),type(n){}

	HLDecomposition(vector<vector<ll>> &g):
		n(g.size()),G(g),vid(n,-1),head(n),sub(n,1),
		par(n,-1),dep(n,0),inv(n),type(n){}

	void add_edge(ll u,ll v) {
		G[u].emplace_back(v);
		G[v].emplace_back(u);
	}

	//森のHL分解の場合、 build() に根の頂点群を引数に指定する
	void build(vector<ll> rs={0}) {
		ll c=0,pos=0;
		for(ll r:rs){
			dfs_sz(r);
			head[r]=r;
			dfs_hld(r,c++,pos);
		}
	}

	ll lca(ll u,ll v){
		while(1){
			if(vid[u]>vid[v]) swap(u,v);
			if(head[u]==head[v]) return u;
			v=par[head[v]];
		}
	}

	ll distance(ll u,ll v){
		return dep[u]+dep[v]-2*dep[lca(u,v)];
	}

	// for_each(vertex)
	// [l, r) <- attention!!
	template<typename F>
	void for_each(ll u, ll v, const F& f) {
		while(1){
			if(vid[u]>vid[v]) swap(u,v);
			f(max(vid[head[v]],vid[u]),vid[v]+1);
			if(head[u]!=head[v]) v=par[head[v]];
			else break;
		}
	}

	template<typename T,typename Q,typename F>
	T for_each(ll u,ll v,T ti,const Q &q,const F &f){
		T l=ti,r=ti;
		while(1){
			if(vid[u]>vid[v]){
				swap(u,v);
				swap(l,r);
			}
			l=f(l,q(max(vid[head[v]],vid[u]),vid[v]+1));
			if(head[u]!=head[v]) v=par[head[v]];
			else break;
		}
		return f(l,r);
	}

	// for_each(edge)
	// [l, r) <- attention!!
	template<typename F>
	void for_each_edge(ll u, ll v,const F& f) {
		while(1){
			if(vid[u]>vid[v]) swap(u,v);
			if(head[u]!=head[v]){
				f(vid[head[v]],vid[v]+1);
				v=par[head[v]];
			}else{
				if(u!=v) f(vid[u]+1,vid[v]+1);
				break;
			}
		}
	}
};

/*-----8<-----library-----8<-----*/

template<typename T1, typename T2> inline T1 power(T1 x, T2 n){ return n ? power(x*x,n/2)*(n%2?x:1) : 1; }

constexpr ll N_MAX = 50;

ll N;
vector<ll> a;
vector<ll> b;
ll M;
vector<ll> u;
vector<ll> v;

void solve() {
	scanf("%lld", &N);
	a.assign(N-1, 0);
	b.assign(N-1, 0);
	rep(i, N-1) { scanf("%lld%lld", &a[i], &b[i]); a[i]--;b[i]--;}
	scanf("%lld", &M);
	u.assign(M, 0);
	v.assign(M, 0);
	rep(i, M) { scanf("%lld%lld", &u[i], &v[i]); u[i]--;v[i]--;}

	vector<vector<ll>> g(N);
	rep(i,N-1){
		ll from=a[i];
		ll to=b[i];
		g[from].push_back(to);
		g[to].push_back(from);
	}
	
	HLDecomposition hdl(g);
	hdl.build({0});

	//条件を少なくとも１つ満たしていないものの数
	ll ans=0;
	for (ll bit = 0, size = (1LL<<M); bit < size; bit++) {
		//ビットが立っている＝条件を満たさないようにしたい
		if(bit==0)continue;

		BinaryIndexedTree<ll> bitree(2*N);
		rep(i, M) {
			if (bit & (1LL<<i)) {
				//i番目の条件を満たさないようにする
				hdl.for_each_edge(u[i], v[i], [&](ll l, ll r){
					bitree.add(l, r, 1);
				});
			}
		}

		ll shiro=0;
		rep(i,N-1){
			hdl.for_each_edge(a[i], b[i], [&](ll l, ll r){
				ll z=bitree.sum(l, r);
				if(z>0)shiro++;
			});	
		}
		debug(bit,shiro,N-1-shiro);
		ll t=pow(2, N-1-shiro);
		ll c=__builtin_popcount(bit);
		//包除原理 
		if(c%2==1)ans+=t;
		else ans-=t;
	}
	
	ans=pow(2, N-1)-ans;
	p(ans);
	
}

// https://atcoder.jp/contests/abc152/tasks/abc152_f
signed main() {
	solve();
	return 0;
}


Measured memory_bytes: 384