#include <bits/stdc++.h>
#define va first
#define vb second
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;

vector<pii> G[51];
int par[51],dep[51],ord[51];

void dfs(int s)
{
	for(pii p:G[s]){
		int e = p.va;
		if(e==par[s]) continue;
		par[e] = s;
		ord[e] = p.vb;
		dep[e] = dep[s]+1;
		dfs(e);
	}
}

int main()
{
    ios_base::sync_with_stdio(0),cin.tie(0);
    int N,M;
    cin >> N;

    ll K[N];
    K[0] = 1;
    for(int i=1; i<N; i++){
    	K[i] = K[i-1]*2;
    }

    int u,v;
    for(int i=1; i<N; i++){
    	cin >> u >> v;
    	G[u].emplace_back(v,i);
    	G[v].emplace_back(u,i);
    }

    dfs(1);

    cin >> M;
    bitset<51> B[1<<M];

    for(int i=0; i<M; i++){
    	cin >> u >> v;

    	if(dep[v]>dep[u]) swap(u,v);


    	while(dep[u]>dep[v]){
    		B[1<<i][ord[u]] = 1;
    		u = par[u];
    	}
    	while(u!=v){
    		B[1<<i][ord[u]] = 1;
    		u = par[u];
    		B[1<<i][ord[v]] = 1;
    		v = par[v];    		
    	}
    }

    ll ans = K[N-1];

    for(int i=1; i<(1<<M); i++){

    	B[i] = B[i-(i&-i)]|B[i&-i];

    	int cnt = N-1;
    	for(int j=1; j<N; j++){
    		cnt -= B[i][j];
    	}

    	if(__builtin_popcount(i)%2) ans -= K[cnt];
    	else ans += K[cnt];
    }

    cout << ans;
}