#pragma GCC optimize("O3")
#pragma GCC target("avx")
#pragma GCC optimize("unroll-loops")
#include <bits/stdc++.h>
using namespace std;
#define LL long long
#define DB double
#define ST string
#define BS bitset
#define PA pair<LL,LL>
#define VE vector
#define VL vector<LL>
#define VP vector<pair<LL,LL>>
#define VVL vector<vector<LL>>
#define PQ priority_queue
#define PQS priority_queue<LL,vector<LL>,greater<LL>>
#define PB push_back
#define POB pop_back
#define PF push_front
#define POF pop_front
#define EB emplace_back
#define MP make_pair
#define TS to_string
#define TU to_ullong
#define BPL __builtin_popcountll
#define FOR(i,a,n) for(i=a;i<n;i++)
#define FORR(i,a,n) for(i=n-1;i>=a;i--)
#define rep(i,n) FOR(i,0,n)
#define repr(i,n) FOR(i,0,n)
#define ALL(a) a.begin(),a.end()
#define RALL(a) a.rbegin(),a.rend()
#define SORT(a) sort(ALL(a))
#define REV(a) reverse(ALL(a))
#define UB(a,n) *upper_bound(ALL(a),n)
#define LB(a,n) *lower_bound(ALL(a),n)
#define INF 1145141919810364364
#define PI 3.14159265358979
#define MOD 1000000007
//#define MOD 998244353
#define ERR 0.00000001
//#define ERR 0.00000000000001
#define NUM 200010
#define FAST cin.tie(0);ios::sync_with_stdio(false)

void Yn(LL a){if(a)printf("Yes\n");else printf("No\n");}
void YN(LL a){if(a)printf("YES\n");else printf("NO\n");}
LL pwmn(LL a,LL n){LL ans=1;while(ans<a)ans*=n;return ans;}
LL GCD(LL a,LL b){LL c=1,tmp=max(a,b);b=min(a,b);a=tmp;while(c!=0){c=a%b;a=b;b=c;}return a;}
LL LCM(LL a,LL b){return a*b/GCD(a,b);}
int lcmp(const void* a,const void* b){if(*(LL*)a>*(LL*)b)return 1;if(*(LL*)a<*(LL*)b)return -1;return 0;}
int lcmpr(const void* a,const void* b){if(*(LL*)a>*(LL*)b)return -1;if(*(LL*)a<*(LL*)b)return 1;return 0;}
int ccmp(const void* a,const void* b){return *(char*)a-*(char*)b;}
int ccmpr(const void* a,const void* b){return *(char*)b-*(char*)a;}
int scmp(const void* a,const void* b){return strcmp((char*)a,(char*)b);}
int scmpr(const void* a,const void* b){return strcmp((char*)b,(char*)a);}
LL mod(LL a,LL m){if(a<0)return a%m+m;else return a%m;}
LL DIV(LL a,LL d){LL m=MOD,x=1,y=0,k;while(m){k=d/m;d-=k*m;swap(m,d);x-=k*y;swap(x,y);}return mod(a*mod(x,MOD),MOD);}
LL POW(LL a,LL n){LL ans=1;while(n>0){if(n&1)ans=ans*a%MOD;a=a*a%MOD;n>>=1;}return ans;}
LL fact[NUM],finv[NUM],inv[NUM];
void comi(){LL i;fact[0]=fact[1]=1;finv[0]=finv[1]=1;inv[1]=1;FOR(i,2,NUM){fact[i]=fact[i-1]*i%MOD;inv[i]=MOD-inv[MOD%i]*(MOD/i)%MOD;finv[i]=finv[i-1]*inv[i]%MOD;}}
LL com(LL n,LL k){if(n<k||n<0||k<0)return 0;return fact[n]*(finv[k]*finv[n-k]%MOD)%MOD;}
bool cmps(pair<LL,LL> a,pair<LL,LL> b){if(a.second!=b.second)return a.second<b.second;return a.first<b.first;}
template<typename T>bool chmax(T &a,T b){if(a<b){a=b;return true;}return false;}
template<typename T>bool chmin(T &a,T b){if(a>b){a=b;return true;}return false;}

struct LCA{
  VVL par,tree;VL d;
  void DFS(LL a,LL p){for(LL i:tree[a])if(i!=p){d[i]=d[a]+1;par[i].EB(a);for(LL k=0;1LL<<(k+1)<=d[i];k++)par[i].EB(par[par[i][k]][k]);par[i].EB(-1);DFS(i,a);}}
  LCA(VVL &v,LL a){LL i,n=v.size();tree=v;par.resize(n);d.resize(n);par[a].EB(-1);DFS(a,-1);}
  LL gpar(LL a,LL n){LL v=a,i=0;if(d[a]<n)return -1;for(LL k=n;k;k/=2){if(k%2)v=par[v][i];i++;}return v;}
  LL lca(LL a,LL b){LL mx,mn,md;if(d[a]<d[b])swap(a,b);a=gpar(a,d[a]-d[b]);if(a==b)return a;mx=d[a],mn=-1;while(mx-mn>1){md=(mx+mn)/2;if(gpar(a,md)==gpar(b,md))mx=md;else mn=md;}return gpar(a,mx);}
};

LL N;
BS<55> path(LL a,LL b,VP &p,LCA &l){
  LL v=l.lca(a,b),pa,i;
  BS<55> ret;
  while(a!=v){
    pa=l.par[a][0];
    rep(i,N-1)if((p[i].first==a&&p[i].second==pa)||(p[i].first==pa&&p[i].second==a)){
      ret[i]=1;
      a=pa;
    }
  }
  while(b!=v){
    pa=l.par[b][0];
    rep(i,N-1)if((p[i].first==b&&p[i].second==pa)||(p[i].first==pa&&p[i].second==b)){
      ret[i]=1;
      b=pa;
    }
  }
  return ret;
}

int main(){
  LL i,j,ans=0,M,a,b,u,v,l;
  cin>>N;
  VVL t(N+1);
  VP p;
  BS<55> n[25];
  rep(i,N-1){
    cin>>a>>b;
    p.PB({a,b});
    t[a].EB(b);
    t[b].EB(a);
  }
  LCA L(t,1);
  cin>>M;
  rep(i,M){
    cin>>u>>v;
    n[i]=path(u,v,p,L);
  }
  rep(i,1LL<<M){
    BS<55> bs;
    rep(j,M)if((1LL<<j)&i)bs|=n[j];
    ans+=(1LL<<(N-1-bs.count()))*(BPL(i)%2?-1:1);
    //cout<<i<<" "<<(1LL<<(N-bs.count()))*(BPL(i)%2?-1:1)<<endl;
  }
  cout<<ans<<endl;
}


Measured memory_bytes: 256