#include<iostream>
#include<cstdio>
#include<cstring>
using namespace std;
typedef long long ll;
const int maxn = 105;
int n, m;
int head[maxn], nxt[maxn << 1], tail[maxn << 1], ecnt = 1;
int a[maxn], x[maxn], y[maxn];
bool col[maxn << 1];
ll ans;

void addedge(int u, int v) {
	nxt[++ecnt] = head[u];
	head[u] = ecnt;
	tail[ecnt] = v;
}

bool dfs1(int u, int p, int t) {
	if (u == t) return true;
	for (int e = head[u]; e; e = nxt[e]) {
		int v = tail[e];
		if (v != p)
			if (dfs1(v, u, t)) {
				col[e] = col[e ^ 1] = true;
				return true;
			}
	}
	return false;
}

void dfs(int pos, int cnt) {
	if (pos == m + 1) {
		if (!cnt) return ;
		memset(col, false, sizeof(col));
		for (int i = 1; i <= cnt; i++) dfs1(x[a[i]], 0, y[a[i]]);
		ll tmp = ecnt - 1; // * 2
		for (int i = 2; i <= ecnt; i++) tmp -= col[i];
		tmp >>= 1;
		tmp = (1LL << tmp);
		if (cnt & 1) ans -= tmp;
		else ans += tmp;
		return ;
	}
	dfs(pos + 1, cnt);
	a[cnt + 1] = pos;
	dfs(pos + 1, cnt + 1);
	a[cnt + 1] = 0;
}

int main() {
	scanf("%d", &n);
	for (int i = 1; i <= n - 1; i++) {
		int u, v; scanf("%d%d", &u, &v);
		addedge(u, v); addedge(v, u);
	}
	scanf("%d", &m);
	for (int i = 1; i <= m; i++) scanf("%d%d", &x[i], &y[i]);
	ans = (1LL << (n - 1));
	dfs(1, 0);
	printf("%lld\n", ans);
	return 0;
}