import java.util.*;
import java.util.Map.Entry;

import javax.swing.text.Segment;
import javax.xml.ws.WebEndpoint;

import java.io.*;
import java.lang.reflect.Array;
import java.math.BigInteger;

import static java.lang.Math.*;
import static java.util.Arrays.*;
import static java.util.Collections.*;
 
public class Main implements Runnable
{
//    static int dx[]={-1,0,1,0};
//    static int dy[]={0,-1,0,1};
    static long mod=1000000007;
    
    public static void main(String[] args) {        
        new Thread(null, new Main(), "", 200 * 1024 * 1024).start();        
    }

    public void run() {
        Reader sc = new Reader(System.in);
        PrintWriter out=new PrintWriter(System.out);

        int n=sc.nextInt();
        ArrayList<Integer> e[]=InputTree(n, sc);
        int m=sc.nextInt();
        long[] x=new long [2], em=new long[m];
        for (int i = 0; i < m; i++) {
			x[0]=sc.nextInt()-1;
			x[1]=0;
			rep(0,e,-1,x);
			x[0]=sc.nextInt()-1;
			rep(0,e,-1,x);			
			em[i]=x[1];
		}
        long ans=1L<<(n-1),v;
        for (int i = 1,bc; i < 1<<m; i++) {
        	long s=0;
        	v=1;
			for (int j = 0; j < m; j++) {
				if((i>>j)%2==1)s|=em[j];
			}
			bc=Long.bitCount(s);
			v=1L<<(n-1-bc);
			ans+=v*(Integer.bitCount(i)%2!=1?1:-1);
		}        

        out.println(ans);
     	out.flush();
    }
    
    static boolean rep(int v, ArrayList<Integer>[] e, int p, long f[]) {
//    	db(v,p,f);
    	if(v==f[0])return true;
    	for (int i = 0,t; i < e[v].size(); i++) {
			t=e[v].get(i);
//			db(t);
			if(t==p)continue;
			if(rep(t,e,v,f)) {
				f[1]^=1L<<(t-1);
				return true;
			}
		}
    	return false;
    }

    static ArrayList[] InputTree(int n, Reader sc) {
        ArrayList<Integer> ret[] = new ArrayList[n];
        for (int i = 0; i < ret.length; i++) {
            ret[i] = new ArrayList<>();
        }
        for (int i = 0; i < n-1; i++) {
            int a=sc.nextInt()-1;
            int b=sc.nextInt()-1;
            ret[a].add(b);
            ret[b].add(a);
        }
        return ret;
    }
        
    static void ret(String ans) {
    	System.out.println(ans);
    	System.exit(0);
    }

    static void ret(long ans) {
    	System.out.println(ans);
    	System.exit(0);
    }
    
    static boolean validpos(int x,int y,int r, int c){
        return x<r && 0<=x && y<c && 0<=y;
    }

    static void db(Object... os){
        System.err.println(Arrays.deepToString(os));
    }
}

//class P {
//	int x,y; double d;
//	P(int  x, int y, double d) {
//	  this.x=x;
//	  this.y=y;
//	  this.d=d;
//	}
//}


class P implements Comparable<P>{
    int x,y;
    P(int x,int y) {
    	this.x=x;
    	this.y=y;
    }

    public int compareTo(P p){
        return y-p.y;
    }
}

class Reader
{ 
    private BufferedReader x;
    private StringTokenizer st;
    
    public Reader(InputStream in)
    {
        x = new BufferedReader(new InputStreamReader(in));
        st = null;
    }
    public String nextString()
    {
        while( st==null || !st.hasMoreTokens() )
			try {
				st = new StringTokenizer(x.readLine());
			} catch (IOException e) {
				// TODO Auto-generated catch block
				e.printStackTrace();
			}
        return st.nextToken();
    }
    public int nextInt()
    {
        return Integer.parseInt(nextString());
    }
    public int[] nextIntArray(int size) {
        int r[] = new int[size];
        for (int i = 0; i < size; i++) {
            r[i] = this.nextInt(); 
        }
        return r;
    }
    public long[] nextLongArray(int size) {
        long r[] = new long[size];
        for (int i = 0; i < size; i++) {
            r[i] = this.nextLong(); 
        }
        return r;
    }
    public char[] getCharSet() {
        return this.nextString().toCharArray();
    }    
    public long nextLong()
    {
        return Long.parseLong(nextString());
    }
    public double nextDouble() throws IOException
    {
        return Double.parseDouble(nextString());
    }
}


Measured memory_bytes: 24276