/*
I am the fire that burns your skin
Soy el fuego que arde tu piel

I am the water that kills your thirst
Soy el agua que mata tu sed

The castle, the tower, I am
El castillo, la torre, yo soy

The sword that keeps the flow
La espada que guarda el caudal

You the air that I breathe
Tú el aire que respiro yo

And the moonlight on the sea
Y la luz de la luna en el mar

The throat that I want to wet
La garganta que ansio mojar

I fear drowning in love
Que temo ahogar de amor

And which desires will you give me?
¿Y cuáles deseos me vas a dar?

You say, 'my treasure just look at it'
Dices tú, 'mi tesoro basta con mirarlo'

And yours will be
Y tuyo será

And yours will be
Y tuyo será
*/
#include <bits/stdc++.h>

#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
using namespace std;

template <typename T>
using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
template <typename T>
using dijkstra = priority_queue<T, vector<T>, greater<T>>;

typedef long long ll;
typedef unsigned long long ull;
#define fbo find_by_order  // k th index
#define ook order_of_key   // strictly smaller than k
#define PI acos(-1.0)
#define inf 0x3f3f3f3f
#define lead_zero(x) __builtin_clzll(x)
#define trail_zero(x) __builtin_ctzll(x)
#define total_1s(x) __builtin_popcountll(x)
#define first_1(x) __builtin_ffsll(x)
#define log2_(x) __builtin_clz(1) - __builtin_clz(x)
#define isLeap(x) ((x % 400 == 0) || (x % 100 ? x % 4 == 0 : false))
#define QUERY           \
    int test;           \
    scanf("%d", &test); \
    for (int _T = 1; _T <= test; _T++)
#define FAST ios_base::sync_with_stdio(0), cin.tie(0)
#define all(v) v.begin(), v.end()
#define reunique(v) v.resize(std::unique(all(v)) - v.begin())
#define pii pair<int, int>
#define pll pair<ll, ll>
#define pul pair<ull, ull>
#define ff first
#define ss second
#define MERGE(v1, v2, v) merge(all(v1), all(v2), back_inserter(v))
#define MP make_pair
#define EB emplace_back
#define read freopen("input.txt", "r", stdin)
#define write freopen("output.txt", "w", stdout)
#define in_range(v, r, l) upper_bound(all(v), r) - lower_bound(all(v), l)
#define LCM(a, b) (a / __gcd(a, b)) * b;

ll rdn(int y, int m, int d) {
    /* Rata Die day one is 0001-01-01 */
    if (m < 3)
        y--, m += 12;
    return 365 * y + y / 4 - y / 100 + y / 400 + (153 * m - 457) / 5 + d - 306;
}
/* Direction arrays */
/*int dx[] = {1,-1,0,0}, dy[] = {0,0,1,-1};                             */  // 4Direction
/*int dx[] = {1,-1,0,0,1,1,-1,-1}, dy[] = {0,0,1,-1,1,-1,1,-1};         */  // 8Direction
/* int dx[] = {1,-1,1,-1,2,2,-2,-2} , dy[] = {2,2,-2,-2,1,-1,1,-1};     */  // KnightDirection
/* int dx[] = {2,-2,1,1,-1,-1} , dy[] = {0,0,1,-1,1,-1};                */  // HexagonalDirection
/* int day[] = {31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31}; */
mt19937 R(chrono::system_clock().now().time_since_epoch().count());
const int N = 55;
vector<int>edges[N];
int idedge[N][N];
int level[N];
int par[N];
ll maskara[N];
void dfs(int x){
    for(int i:edges[x]){
        if(par[i]!=-1)continue;
        level[i] = level[x]+1;
        par[i] = x;
        dfs(i);
    }
}
int main() {
    FAST;
    int n,a,b;
    cin>>n;
    for(int i=0;i<n-1;i++){
        cin>>a>>b;
        idedge[a][b] = i;
        idedge[b][a] = i;
        edges[a].EB(b);
        edges[b].EB(a);
    }
    memset(par,-1,sizeof par);
    par[1] = 1;
    dfs(1);

    ll m;
    cin>>m;
    for(int i=0;i<m;i++){
        cin>>a>>b;
        if(level[a]>level[b])swap(a,b);
        ll mask = 0;
        // while (level[b]>level[a])
        // {
        //     cerr<<idedge[par[b]][b]<<" ";
        //     mask|=(1LL<<idedge[par[b]][b]);
        //     b = par[b];
        // }
        
        while (b!=a && par[b]!=b)
        {
           // cerr<<idedge[par[b]][b]<<" ";
            mask^=(1LL<<idedge[par[b]][b]);
            b = par[b];
        }
        while (b!=a && par[a]!=a)
        {
           // cerr << idedge[par[b]][b] << " ";
            mask^=(1LL<<idedge[par[a]][a]);
            a = par[a];
        }
        cerr<<endl;
        maskara[i] = mask;
    }

    ll ans = (1LL<<(n-1));
    for(int i=1;i<(1<<m);i++){
        int cnt = 0;
        ll mask = 0;
        for(int j=0;j<m;j++){
            if(i&(1<<j)){
                cnt++;
                mask = mask|(maskara[j]);
            }
        }
        if(cnt&1){
            ans = (ans - (1LL<<(n-1-total_1s(mask))));
        }
        else{
            ans = (ans + (1LL << (n - 1 - total_1s(mask))));
        }
    }
    cout<<ans<<"\n";
}


Measured memory_bytes: 256