#include "bits/stdc++.h"
using namespace std;
using ll = long long;
using vll = std::vector<ll>;
using vvll = std::vector<vll>;
using vvvll = std::vector<vvll>;
using dd = double;
using vdd = std::vector<dd>;
using vvdd = std::vector<vdd>;
using vvvdd = std::vector<vvdd>;
using pll = pair<ll, ll>;

constexpr ll INF = 1LL << 60;
constexpr dd EPS = 1e-11;

//cin,cout高速化のおまじない＋桁数指定
struct Fast{
	Fast(){
		cin.tie(0);
		ios::sync_with_stdio(false);
		cout << fixed << setprecision(std::numeric_limits<double>::max_digits10);
	}
} fast;

#define REPS(i, S, E) for (ll i = (S); i <= (E); i++)
#define REP(i, N) REPS(i, 0, (N)-1)
#define DEPS(i, S, E) for (ll i = (E); i >= (S); i--)
#define DEP(i, N) DEPS(i, 0, (N)-1)
#define EACH(e, v) for (auto&& e : v)

template<class T> inline bool chmax(T &a, T b) { if (a < b) { a = b; return true; }return false; }
template<class T> inline bool chmin(T &a, T b) { if (a > b) { a = b; return true; }return false; }
template<class T> inline T MaxE(vector<T>&v,ll S,ll E){T m=v[S]; REPS(i,S,E)chmax(m,v[i]); return m;}//v[S]～v[E]の最大値
template<class T> inline T MinE(vector<T>&v,ll S,ll E){T m=v[S]; REPS(i,S,E)chmin(m,v[i]); return m;}//v[S]～v[E]の最小値
template<class T> inline T MaxE(vector<T> &v, ll N) { return MaxE(v, 0, N - 1); } //先頭N個中の最大値
template<class T> inline T MinE(vector<T> &v, ll N) { return MinE(v, 0, N - 1); }
template<class T> inline T MaxE(vector<T> &v) { return MaxE(v, (ll)v.size()); }
template<class T> inline T MinE(vector<T> &v) { return MinE(v, (ll)v.size()); }
template<class T> inline ll MaxI(vector<T>&v,ll S,ll E){ll m=S; REPS(i,S,E){if(v[i]>v[m])m=i;} return m;}
template<class T> inline ll MinI(vector<T>&v,ll S,ll E){ll m=S; REPS(i,S,E){if(v[i]<v[m])m=i;} return m;}
template<class T> inline ll MaxI(vector<T> &v, ll N) { return MaxI(v, 0, N - 1); }
template<class T> inline ll MinI(vector<T> &v, ll N) { return MinI(v, 0, N - 1); }
template<class T> inline ll MaxI(vector<T> &v) { return MaxI(v, (ll)v.size()); }
template<class T> inline ll MinI(vector<T> &v) { return MinI(v, (ll)v.size()); }
template<class T> inline T Sum(vector<T> &v, ll S,ll E){ T s=v[S]; REPS(i,S+1,E)s+=v[i]; return s; }
template<class T> inline T Sum(vector<T> &v, ll N) { return Sum(v, 0, N - 1); }
template<class T> inline T Sum(vector<T> &v) { return Sum(v, v.size()); }
template<class T> inline T POW(T a, ll n){ T r=1; for (; n>0; n>>=1, a*=a){ if (n&1)r*=a; } return r; }
inline ll POW(int a, ll n){ return POW((ll)a, n); }
inline ll MSB(ll a){for(ll o=63,x=-1;;){ll m=(o+x)/2; if(a<(1LL<<m))o=m; else x=m; if(o-x==1)return x;}}
inline ll CEIL(ll a, ll b){ return (a+b-1)/b; }
ll Gcd(ll a, ll b){ return (b==0) ? a : Gcd(b, a%b); }
ll Lcm(ll a, ll b){ return a * b / Gcd(a, b); }
inline vll Mask2Idx(ll m){vll v; for(ll i=0;m;m>>=1,i++) if(m&1)v.push_back(i); return move(v);}


template<class T=ll> inline vector<T> cinv(ll N){ vector<T> v(N); REP(i, N)cin>>v[i]; return move(v);}
template<class T=ll, class S=ll> inline vector<pair<T, S>> cinv2(ll N){
	vector<pair<T, S>> v(N); REP(i,N){cin>>v[i].first>>v[i].second;} return move(v); }
template<class T=ll,class S=ll,class R=ll> inline vector<tuple<T, S, R>> cinv3(ll N){
	vector<tuple<T,S,R>> v(N); REP(i,N){cin>>get<0>(v[i])>>get<1>(v[i])>>get<2>(v[i]);} return move(v);}
template<class T=ll,class S=ll,class R=ll,class Q=ll> inline vector<tuple<T,S,R,Q>> cinv4(ll N){
	vector<tuple<T,S,R,Q>> v(N); REP(i,N){cin>>get<0>(v[i])>>get<1>(v[i])>>get<2>(v[i])>>get<3>(v[i]);} return move(v);}
template<class T> inline void coutv(vector<T> &v, char deli=' '){
	ll N=(ll)v.size(); REP(i,N){cout << v[i] << ((i==N-1)?'\n':deli);} }
template<class T> void bye(T a){cout << a << '\n'; exit(0);}


struct mll{
	static ll MOD;
	ll val;
	mll(ll v = 0): val(v % MOD){ if (val < 0) val += MOD; }
	mll operator - () const { return -val; }
	mll operator + (const mll &b) const { return val + b.val; }
	mll operator - (const mll &b) const { return val - b.val; }
	mll operator * (const mll &b) const { return val * b.val; }
	mll operator / (const mll &b) const { return mll(*this) /= b; }
	mll operator + (ll b) const { return *this + mll(b); }
	mll operator - (ll b) const { return *this - mll(b); }
	mll operator * (ll b) const { return *this * mll(b); }
	friend mll operator + (ll a, const mll &b) { return b + a; }
	friend mll operator - (ll a, const mll &b) { return -b + a; }
	friend mll operator * (ll a, const mll &b) { return b * a; }
	friend mll operator / (ll a, const mll &b) { return mll(a)/b; }
	mll &operator += (const mll &b) { val=(val+b.val)%MOD; return *this; }
	mll &operator -= (const mll &b) { val=(val+MOD-b.val)%MOD; return *this; }
	mll &operator *= (const mll &b) { val=(val*b.val)%MOD; return *this; }
	mll &operator /= (const mll &b) {
		ll c=b.val, d=MOD, u=1, v=0;
		while (d){
			ll t = c / d;
			c -= t * d; swap(c, d);
			u -= t * v; swap(u, v);
		}
		val = val * u % MOD;
		if (val < 0) val += MOD;
		return *this;
	}
	mll &operator += (ll b) { return *this += mll(b); }
	mll &operator -= (ll b) { return *this -= mll(b); }
	mll &operator *= (ll b) { return *this *= mll(b); }
	mll &operator /= (ll b) { return *this /= mll(b); }
	bool operator == (const mll &b) { return val == b.val; }
	bool operator != (const mll &b) { return val != b.val; }
	bool operator == (ll b) { return *this == mll(b); }
	bool operator != (ll b) { return *this != mll(b); }
	friend bool operator == (ll a, const mll &b) { return mll(a) == b.val; }
	friend bool operator != (ll a, const mll &b) { return mll(a) != b.val; }
	friend ostream &operator << (ostream &os, const mll &a) { return os << a.val; }
	friend istream &operator >> (istream &is, mll &a) { return is >> a.val; }
	static mll Combination(ll a, ll b){
		chmin(b, a-b);
		if (b<0) return mll(0);
		mll c = 1;
		REP(i, b) c *= a-i;
		REP(i, b) c /= i+1;
		return c;
	}
};
ll mll::MOD = 1000000007LL;// 998244353LL;//1000000007LL;
using vmll = std::vector<mll>;
using vvmll = std::vector<vmll>;
using vvvmll = std::vector<vvmll>;
using vvvvmll = std::vector<vvvmll>;

vvll in_Graph(ll nodeNum, ll edgeNum, bool isDirected){
	vvll to(nodeNum);
	REP(i, edgeNum){
		ll v, u;
		cin >> v >> u;
		v--; u--;
		to[v].push_back(u);
		if (!isDirected) to[u].push_back(v);
	}
	return std::move(to);
}

class Dubling{
private:
	vvll next;
	ll N, B;
	ll next_(ll v, ll i){ return (v<0) ? -1 : next[v][i]; }
public:
	Dubling(): N(0), B(0) {}
	Dubling(const vll &nxt, ll nextTimesMax){ Init(nxt, nextTimesMax); }
	void Init(const vll &nxt, ll nextTimesMax){
		N = (ll)nxt.size();
		B = MSB(nextTimesMax) + 1;
		next.resize(N, vll(B, -1));
		REP(v, N) next[v][0] = nxt[v];
		REPS(i, 1, B-1) REP(v, N) next[v][i] = next_(next_(v, i-1), i-1);
	}
	ll Times(ll v, ll times){ //!< times個先  times=0も可
		DEPS(i, 0, MSB(times))  if ((times>>i)&1) v = next_(v, i);
		return v;
	}
	ll TimesPow2(ll v, ll i) { return next[v][i]; }  //!< 2^i個先
};

struct DepthOfTree{
	vvll &to; vll depth;
	DepthOfTree(vvll &to, ll root): to(to), depth(to.size()) { dfs(root, -1, 0); }
	void dfs(ll v,ll p,ll d){ EACH(u,to[v]) if(u!=p) dfs(u,v,depth[u]=d+1); }
	vll get(){ return move(depth); }
};

struct ParentOfTree{
	vvll &to; vll parent;
	ParentOfTree(vvll &to,ll root): to(to), parent(to.size(),-1) {dfs(root,-1);}
	void dfs(ll v, ll p){ EACH(u, to[v]) if (u!=p) dfs(u, parent[u]=v); }
	vll get(){ return move(parent); }
};

struct LCA{
	vvll &to; vll depth; Dubling pDbl;
	LCA(vvll &to, ll root): to(to), depth(move(DepthOfTree(to,root).get())),
		pDbl( ParentOfTree(to,root).get(), (ll)to.size() ) {}
	ll operator() (ll v, ll u){
		ll dv = this->depth[v], du = this->depth[u];
		if (dv < du) { swap(v, u); swap(dv, du); }
		if ((v = this->pDbl.Times(v, dv-du)) == u) return v;
		DEPS(i, 0, MSB(du)){
			ll vv = this->pDbl.TimesPow2(v, i), uu = this->pDbl.TimesPow2(u, i);
			if (vv != uu) { v = vv; u = uu; }
		}
		return this->pDbl.TimesPow2(v, 0);
	}
};

vvll to;
vll pathNum;

pll dfsCount(ll v, ll p){
	ll pNumAll=0, eNumAll=0;
	EACH(u, to[v]){
		if (u == p) continue;

		ll pNum, eNum;
		tie(pNum,eNum) = dfsCount(u, v);
		pNumAll += pNum;
		eNumAll += eNum;
	}
	pNumAll += pathNum[v];
	if (pNumAll > 0) eNumAll++;
	return pll(pNumAll, eNumAll);
}


void solve()
{
	ll N; cin >> N;
	to = in_Graph(N, N-1, false);

	ll M; cin >> M;
	auto uv = cinv2(M);
	EACH(e, uv){e.first--; e.second--;}

	//各パスのLCAを得る
	LCA lca(to, 0);
	vll LCAs(M);
	REP(m, M){
		ll u, v;
		tie(u, v) = uv[m];
		LCAs[m] = lca(u, v);
	}

	pathNum.resize(N);

	ll ans = 1LL<<(N-1);
	REPS(mask, 1, (1LL<<M)-1){
		vll idxvec = Mask2Idx(mask);
		pathNum.assign(N,0);
		EACH(idx, idxvec){
			ll u, v; tie(u,v) = uv[idx];
			ll lca = LCAs[idx];
			pathNum[u]++;
			pathNum[v]++;
			pathNum[lca]-=2;
		}

		ll dmy, c;
		tie(dmy, c) = dfsCount(0, -1);

		ans += POW(-1, (ll)idxvec.size()) * (1LL<<(N-1-c));
	}

	cout << ans << '\n';
}


int main(){
	solve();
	return 0;
}


Measured memory_bytes: 384