#include <bits/stdc++.h>
using namespace std;
#define ff              first
#define ss              second
#define pb(x)           push_back(x)
#define mp              make_pair
#define sz(x)           x.size()
#define mem(x ,y)       memset(x , y , sizeof x )
#define all(a )         a.begin() , a.end()
#define endl            "\n"
#define pii             pair<int,int> 
#define clr(x)          x.clear()
#define sl(x )          scanf("%I64d" ,&x)
#define si(x )          scanf("%d" ,&x)
#define forn(i ,x,n )   for(int i = x ; i <= n ; i++ )
#define ford(i ,x,n )   for(int i = x ; i >= n ; i-- )
#define rep(i,n )       for(int i= 0; i<n ; i++ )
#define repi(i,n )      for(int i= 1; i<=n ; i++ )
#define repit(i, c)     for( __typeof((c).begin()) i = (c).begin(); i != (c).end();++i )
#define dbg(args...)    do {   cerr << #args << ' ' ;  print(args); } while(0); cerr<< endl ;
typedef long long ll  ;
int  mod1 =  1e9+7, mod2 = 998244353 ; 
int mod  =  mod1 ;
typedef unsigned long long  ull ;
int setbit(int n, int pos  ) { return n = n|(1<< pos) ; }
int resetbit(int n,int pos ) {  return n =  n & ~(1<<pos ); }
bool checkbit(int  n,int pos ) { return (bool ) (n&(1<<pos))  ; }
template < typename T > T mul(T x, T y, T mod = mod ) { x %= mod ; y %= mod ; return (x*y)%mod  ;  }
template < typename T > T add(T x, T y, T mod = mod ) { x %= mod ; y %= mod ; return (x+y)%mod ;  }
template < typename T > T sub(T x, T y, T mod = mod ) { x %= mod ; y %= mod ; return ((x-y)%mod+mod )%mod;  }
template < typename T > T ext_gcd(T num1 , T num2, T &X , T &Y ) { T r2,r1, q2, q1 , x2, x1, y2 ,y1 , x,  y, r   ; x2 = 1; y2 = 0;  x1 = 0; y1 = 1; for( r2 =num1 ,r1 = num2 ;r1 != 0 ; y2 = y1, y1 = y,x2 = x1 ,x1 = x ,r2 = r1, r1 = r) {q1 = r2/r1; x = x2 - q1*x1; y = y2 - q1*y1; r = r2%r1 ; } X = x2 ; Y = y2 ; return r2 ;  }
template < typename T > void print(const T& v) {    cerr << v << ' ' ;}
template < typename T1, typename... T2 > void print( const T1& first, const T2&... rest ){ print(first); print(rest...) ;}
template<class T> string to_str(T t){stringstream ss; ss<<t; return ss.str();} 
template < typename T > 
T  bigmod(T x, T k ,T mod = mod) {
    if(k == 0 ) return (T)1; 
    if(k&1  ) { 
        return ( (x%mod)*bigmod(x,k-1, mod )%mod )%mod ; 
    } else { 
        T ret = bigmod(x,k/2  , mod ) ; 
        ret %= mod ;             
        return (ret*ret )%mod; 
    } 
 
}
template < typename T > 
T  invmod( T x , T m) {  
    return bigmod(x,m-2 , m) ;   
    // long long ret, t ;// 
    // ext_gcd( x, m ,ret ,t  ) ;
    // ret %= m ; if(ret<0) ret += m  ; 
    // return ret;
} 
// #include <ext/pb_ds/assoc_container.hpp>
// #include <ext/pb_ds/tree_policy.hpp>
// using namespace __gnu_pbds;
// typedef tree< int   ,     // change type 
//               null_type, 
//               less_equal  < int >  ,  // change type ..    
//               rb_tree_tag,
//               tree_order_statistics_node_update> o_set;
// less for set and  less_equal  for multiset  
// order_of_key (k) : Number of items strictly smaller than k 
// find_by_order(k) : K-th element in a set (counting from zero) returns iterator 
// debuging ...
template<typename T > 
void dbg_a(T a[] ,int n=10 ) {
    cerr << "[ "; 
        for(int i=0;i < n ; i++ )
            cerr<<a[i]<<' ' ; 
                cerr<< " ]" <<  endl; 
} 
template < typename F,  typename S >
ostream& operator << ( ostream& os, const pair< F, S > & p ) {
    return os << "[ " << p.first << ", " << p.second << " ]";
}
template < typename T >
ostream &operator << ( ostream & os, const vector< T > &v ) {
    os << "[ "; 
        for(int i=0; i<sz(v) ; i++ )  
            os << v[i] << ' ' ; 
                return os << " ]\n" ; 
} 
template < typename T >
ostream &operator << ( ostream & os, const map< T ,T> &Map  ) {
    os << "[ "; 
        repit(it , Map )    
            os << "[" <<(*it).ff << ' ' << (*it).ss << "] "    ; 
                return os << "]\n" ; 
} 
template < typename T >
ostream &operator << ( ostream & os, const set< T > &Set  ) {
    os << "[ "; 
        repit(it , Set )   
            os <<  *it  << ' ' ; 
                return os << " ]\n" ; 
} 
// int dx[] = {0 , 0 ,+1, -1 } ;
// int dy[] = {-1, +1,0 , 0 };
// int dx[ 10 ] =  {-2,-2, 2, 2  ,+ 1, -1  , +1, -1 }  ;
// int dy[ 10 ] =  {+1,-1, 1, -1 , +2,+2 , -2,-2  }  ;
const int maxn  = (int )200 ;
const int  inf  =  1e8 ;
#define  int   ll 
///////////////////////////////////////////////////////////////

 
int masks[100][100 ] , Mask= 0 ,  n ; 
set<int> S[maxn] ; 
vector< pair<int,int > > res ,edges   ; 
vector< int >g[maxn ] ; 
ll dp[50][(1LL<<20)+123] ;
 
void printMask(int x)  {
    ford(i , 5, 0 ) cout << checkbit(x,i ) ;
    cout << endl; 
 
}
int dfs(int u ,int  p  ){
    rep( i , sz(g[u ]) ) {
        int v = g[u][i] ; 
        if( v == p ) continue ;
    
        dfs(v, u ) ; 
 
        repit(it  , S[v  ] ) {
            int k = *it ; 
            S[u].insert(k) ;
 
        }
        // generate mask for u , v 
        int mask = 0 ; 
        
        // cout << "\n" << u << "-> " ;
        // cout << S[u] << endl ; 
        rep( k,sz(res ) ) {
            int x = res[k].ff , y = res[k].ss ;
            if(S[v].find(x)  == S[v].end()  and S[v].find(y)  == S[v].end()   ) continue ;
            if(S[v].find(x)  != S[v].end()  and S[v].find(y)  != S[v].end()   ) continue ;
    
            // if(S[v].find(x) !=  S[v].end() or S[v].find(y)  != S[v].end()  ) {
                mask = mask|(1<<k ) ;  
            
 
        }           
        masks[u][v] = masks[v][u] = mask ;
    }
 
    S[u].insert(u) ;
}
int func(int id , int mask )  {
    if(id>=sz(edges) )  {
        return mask ==  Mask    ;
    }
    ll &ans = dp[id][mask ] ;
    int  x =edges[id].ff , y = edges[id].ss  ;
 
    if(ans !=-1)  return ans ; 
    ans = 0 ; 
    ans = func(id+1 , mask) ;
    ans += func(id+1 , mask|masks[x][y]  ) ;    
    return ans ; 
 
 
}
void solve()  { 
    int x ,y, ans= 0 ,d   ,q ,lo =1 , hi , mid   ; 
    
    cin >> n; 
    rep(i,n -1) {
        cin >>x >> y ; 
        g[x ].pb(y) ; 
        g[y].pb(x)  ; 
 
        edges.pb(mp(x,y) ) ;
    } 
    cin >>q ;
    rep(i, q) {
        cin>> x >> y ; 
        res.pb( mp(x ,y ))  ;
    }
 
    dfs(1,-1 );  
    Mask =  (1LL<<q  ) -1 ; 
 
    mem(dp ,-1) ; 
    cout << func(0 ,0  ) << endl; 
 
 
 
}   
signed main() {
    #ifndef ONLINE_JUDGE
       //freopen("in.txt", "r", stdin);
          // freopen("out.txt", "w", stdout);
    #endif 
    ios :: sync_with_stdio(false);  cin.tie(0);  
    cout.tie(0) ; 
    clock_t st = clock() ;
    int  c = 0 ,t = 1 ;  
    // cin>>t ;
    while(t--) {
        solve()  ;
    }  
    cerr << "\nDon't let your dreams be memes."  << endl; 
    // cerr << setprecision(6) << fixed << "Execution time : " << (double  )  (clock()-st )/CLOCKS_PER_SEC << endl ; 
 
    return 0 ;  
 
}      
 
     

Measured memory_bytes: 409984