/*********************
*  Author: xuziyuan  * 
*********************/
 
#include <bits/stdc++.h>
 
#define rep(i,n) for(int i=0;i<n;i++)
#define repn(i,n) for(int i=1;i<=n;i++)
#define LL long long
#define pii pair <LL,LL>
#define fi first
#define se second
#define pb push_back
#define mpr make_pair
 
using namespace std;
 
LL n,m,x,y,re[60],ans=0;
vector <pii> g[60];
bool vis[60];
 
bool dfs(LL pos,LL to,LL k)
{
  vis[pos]=true;
  if(pos==to) return true;
  rep(i,g[pos].size())
  {
    if(vis[g[pos][i].fi]) continue;
    if(dfs(g[pos][i].fi,to,k))
    {
      re[k]|=(1LL<<g[pos][i].se);
      return true;
    }
  }
  return false;
}
 
int main()
{
  cin>>n;
  rep(i,n-1)
  {
    cin>>x>>y;
    g[x].pb(mpr(y,i+1));
    g[y].pb(mpr(x,i+1));
  }
  cin>>m;
  rep(i,m)
  {
    cin>>x>>y;
    memset(vis,0,sizeof(vis));
    dfs(x,y,i);
  }
  repn(i,(1<<m)-1)
  {
    LL num=0,now=0;
    rep(j,m)
    {
      if((i&(1<<j))==0) continue;
      now|=re[j];
      num++;
    }
    LL c=0;
    while(now>0)
    {
      c+=now%2;
      now/=2;
    }
    LL res=(LL)pow(2,n-1-c);
    if(num%2==1) ans+=res;
    else ans-=res;
  }
  cout<<(LL)pow(2,n-1)-ans<<endl;
  return 0;
}