#include <bits/stdc++.h>

using namespace std;

const int OO = 1e9;
const double EPS = 1e-9;

#define ndl cout << '\n'
#define sz(v) int(v.size())
#define pb push_back
#define mp make_pair
#define fs first
#define sc second
#define present(a, x) (a.find(x) != a.end())
#ifdef LOCAL
#define db(...) ({cout << "> Line " << __LINE__  \
		<< ": "; _db(#__VA_ARGS__, __VA_ARGS__);})
#define RNG() rng()
#else
#define db(...) true
#define RNG() true
#endif

template<class T>
void _db(const char *dbStr, T e) {
	cout << dbStr << " = " << e << endl;
}
template<class T, class... L>
void _db(const char *dbStr, T e, L... r) {
  while(*dbStr != ',') cout << *dbStr++;
  cout << " = " << e << ','; _db(dbStr + 1, r...);
}
template<class S, class T>
ostream& operator<<(ostream& o, const map<S, T>& v) {
	o << "["; int i = 0;
	for (const pair<S, T>& pr : v) o << (!i++ ? "" : ", ") << "{"
	<< pr.fs << " : " << pr.sc << "}"; return o << "]";
}
template<template <class, class...> class S, class T, class... L>
ostream& operator<<(ostream& o, const S<T, L...>& v) {
	o << "["; int i = 0;
	for (const auto& e : v) o << (!i++ ? "" : ", ") << e;
	return o << "]";
}
template<class S, class T>
ostream& operator<<(ostream& o, const pair<S, T>& pr) {
	return o << "(" << pr.fs << ", " << pr.sc << ")";
}
ostream& operator<<(ostream& o, const string& s) {
	for (const char& c : s) o << c;
	return o;
}

template<class T> using V = vector<T>;
template<class T> using VV = V<V<T>>;
template<class T> using VVV = VV<V<T>>;
using ll = long long;
using pii = pair<int, int>;
using vi = V<int>;
using vii = V<pii>;
using vvi = VV<int>;
using mii = map<int, int>;
using umii = unordered_map<int, int>;
using si = set<int>;
using usi = unordered_set<int>;

int N, M;
V<vii> adj(55);
vi path;
int pid;
int edgeMask[55];	// edgesMask[i] = mask including which
// of the M paths pass through i'th edge



void dfs(int u, int p, int w) {
	if (u == w) {
		db(w, path, pid);
		for (auto& e : path) {
			edgeMask[e] |= (1 << pid);
		}
		return;
	}

	for (auto& pr : adj[u]) {
		int v = pr.fs, eid = pr.sc;
		if (v != p) {
			path.pb(eid);
			dfs(v, u, w);
			path.pop_back();
		}
	}
}

int main() {
	#ifdef LOCAL
	auto stTime = clock();
//	freopen("in.txt", "r", stdin);
	mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
	#endif
	ios::sync_with_stdio(false);
	cout.precision(10);
	cin.tie(0);

	cin >> N;

	for (int i = 0; i < N - 1; ++i) {
		int u, v;
		cin >> u >> v;
		adj[u].pb(mp(v, i));
		adj[v].pb(mp(u, i));
	}

	cin >> M;

	for (int i = 0; i < M; ++i) {
		int u, v;
		pid = i;
		cin >> u >> v;
		path.clear();
		dfs(u, -1, v);
	}

	for (int i = 0; i < N - 1; ++i) {
		db(edgeMask[i]);
	}

	ll invalid = 0;

	for (int mask = 1; mask < (1 << M); ++mask) {
		short mskSize = 0;
		int tmp = mask;
		while (tmp)
			mskSize += (tmp & 1), tmp >>= 1;

		db(mskSize);


		int edgesInMsk = 0;

		for (int i = 0; i < N - 1; ++i) {
			edgesInMsk += (edgeMask[i] & mask ? 1 : 0);
		}

		ll cnt = (1LL << (N - 1 - edgesInMsk));

		db(cnt);

		db(edgesInMsk);

		if (mskSize & 1)
			invalid += cnt;
		else
			invalid -= cnt;

		db(invalid);
	}

	db(invalid);

	cout << (1LL << (N - 1)) - invalid << '\n';


	#ifdef LOCAL
	cout << "\n\n\nExecution time: " <<
		(clock() - stTime) * 1e3 / CLOCKS_PER_SEC << " ms" << endl;
	#endif
    return 0;
}


Measured memory_bytes: 256