#include<bits/stdc++.h>
using namespace std;

#define endl '\n'
#define lfs cout<<fixed<<setprecision(10)
#define ALL(a)  (a).begin(),(a).end()
#define ALLR(a)  (a).rbegin(),(a).rend()
#define spa << " " <<
#define test cout<<"test"<<endl;
#define fi first
#define se second
#define MP make_pair
#define MT make_tuple
#define PB push_back
#define EB emplace_back
#define rep(i,n,m) for(ll i = (n); i < (ll)(m); i++)
#define rrep(i,n,m) for(ll i = (m) - 1; i >= (ll)(n); i--)
using ll = long long;
using ld = long double;
const ll MOD = 1e9+7;
//const ll MOD = 998244353;
//const ll INF = 1e18;
using P = pair<ll, ll>;
template<typename T>
void chmin(T &a,T b){if(a>b)a=b;}
template<typename T>
void chmax(T &a,T b){if(a<b)a=b;}
void pmod(ll &a,ll b){a=(a+b)%MOD;}
void pmod(ll &a,ll b,ll c){a=(b+c)%MOD;}
void qmod(ll &a,ll b){a=(a*b)%MOD;}
void qmod(ll &a,ll b,ll c){a=(b*c)%MOD;}
ll median(ll a,ll b, ll c){return a+b+c-max({a,b,c})-min({a,b,c});}
void ans1(bool x){if(x) cout<<"Yes"<<endl;else cout<<"No"<<endl;}
void ans2(bool x){if(x) cout<<"YES"<<endl;else cout<<"NO"<<endl;}
void ans3(bool x){if(x) cout<<"Yay!"<<endl;else cout<<":("<<endl;}
template<typename T1,typename T2>
void ans(bool x,T1 y,T2 z){if(x)cout<<y<<endl;else cout<<z<<endl;}  
template<typename T>
void debug(vector<vector<T>>&v,ll h,ll w){for(ll i=0;i<h;i++)
{cout<<v[i][0];for(ll j=1;j<w;j++)cout spa v[i][j];cout<<endl;}};
void debug(vector<string>&v,ll h,ll w){for(ll i=0;i<h;i++)
{for(ll j=0;j<w;j++)cout<<v[i][j];cout<<endl;}};
template<typename T>
void debug(vector<T>&v,ll n){if(n!=0)cout<<v[0];
for(ll i=1;i<n;i++)cout spa v[i];cout<<endl;};
template<typename T>
vector<vector<T>>vec(ll x, ll y, T w){
  vector<vector<T>>v(x,vector<T>(y,w));return v;}
ll gcd(ll x,ll y){ll r;while(y!=0&&(r=x%y)!=0){x=y;y=r;}return y==0?x:y;}
vector<ll>dx={1,0,-1,0,1,1,-1,-1};
vector<ll>dy={0,1,0,-1,1,-1,1,-1};
template<typename T>
vector<T> make_v(size_t a,T b){return vector<T>(a,b);}
template<typename... Ts>
auto make_v(size_t a,Ts... ts){
  return vector<decltype(make_v(ts...))>(a,make_v(ts...));
}
ostream &operator<<(ostream &os, pair<ll, ll>&p){
  return os << p.first << " " << p.second;
}  
ll MAX_V = 51;
struct edge {
  ll to,num;
  edge(ll x,ll y):to(x),num(y){};
};

vector<ll>t(MAX_V);
bool tmp=true;
bool dfs(ll k,vector<vector<edge>>&g,vector<ll>&v,ll goal){
  t[k]=1;
  if(k==goal)return true;
  for(auto e:g[k]){
    if(t[e.to]==0){
      v.PB(e.num);
      auto p=dfs(e.to,g,v,goal);
      if(p)return true;
      v.pop_back(); 
    }
  }
  return false;
}
int main(){
  cin.tie(nullptr);
  ios_base::sync_with_stdio(false);
  ll res=0,buf=0;
  bool judge = true;
  ll n;cin>>n;
  vector<vector<edge>>g(n);
  rep(i,0,n-1){
    ll a,b;cin>>a>>b;a--;b--;
    g[a].EB(b,i);
    g[b].EB(a,i);
  }
  ll m;cin>>m;
  vector<vector<ll>>v(m);
  rep(i,0,m){
    ll x,y;cin>>x>>y;x--;y--;
    fill(ALL(t),0);
    dfs(x,g,v[i],y);
  }
  
  vector<bitset<50>>dp(m);
  rep(i,0,m){
    for(auto z:v[i])dp[i][z]=true;
  }
  res=1LL<<n-1;
  rep(i,1,1<<m){
    tmp=false;
    unordered_set<ll>st;
    bitset<20>x=i;
    bitset<50>y=0;
    rep(j,0,m){
      if(x[j])y|=dp[j];
    }
    ll num=__builtin_popcount(i);
    ll mi=0;
    rep(j,0,n-1)if(y[j])mi++;
    if(num%2==1)res-=1LL<<n-1-mi;
    else res+=1LL<<n-1-mi;
    //cout<<i spa res spa n-1-mi<<endl;
  }
  cout<<res<<endl;
  return 0;
}

Measured memory_bytes: 256