We have a tree with N vertices numbered 1 to N. The i-th edge in this tree connects Vertex a_i and Vertex b_i.
Consider painting each of these edges white or black. There are 2^{N-1} such ways to paint the edges. Among them, how many satisfy all of the following M restrictions?

* The i-th (1 \leq i \leq M) restriction is represented by two integers u_i and v_i, which mean that the path connecting Vertex u_i and Vertex v_i must contain at least one edge painted black.

Constraints

* 2 \leq N \leq 50
* 1 \leq a_i,b_i \leq N
* The graph given in input is a tree.
* 1 \leq M \leq \min(20,\frac{N(N-1)}{2})
* 1 \leq u_i < v_i \leq N
* If i \not= j, either u_i \not=u_j or v_i\not=v_j
* All values in input are integers.

Input

Input is given from Standard Input in the following format:


N
a_1 b_1
:
a_{N-1} b_{N-1}
M
u_1 v_1
:
u_M v_M


Output

Print the number of ways to paint the edges that satisfy all of the M conditions.

Examples

Input

3
1 2
2 3
1
1 3


Output

3


Input

2
1 2
1
1 2


Output

1


Input

5
1 2
3 2
3 4
5 3
3
1 3
2 4
2 5


Output

9


Input

8
1 2
2 3
4 3
2 5
6 3
6 7
8 6
5
2 7
3 5
1 6
2 8
7 8


Output

62
import java.io.BufferedReader;
import java.io.InputStreamReader;
import java.util.ArrayList;
import java.util.HashSet;
import java.util.List;
import java.util.Set;

public class Main {
	static List<List<Hen>> list;

	public static void main(String[] args) throws Exception {
		BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
		String[] sa = br.readLine().split(" ");
		int n = Integer.parseInt(sa[0]);
		Hen[] hens = new Hen[n - 1];
		list = new ArrayList<>(n);
		for (int i = 0; i < n; i++) {
			list.add(new ArrayList<>());
		}
		for (int i = 0; i < n - 1; i++) {
			sa = br.readLine().split(" ");
			Hen h = new Hen();
			h.a = Integer.parseInt(sa[0]) - 1;
			h.b = Integer.parseInt(sa[1]) - 1;
			h.i = i;
			hens[i] = h;
			list.get(h.a).add(h);
			list.get(h.b).add(h);
		}
		int m = Integer.parseInt(br.readLine());
		Cond[] conds = new Cond[m];
		for (int i = 0; i < m; i++) {
			sa = br.readLine().split(" ");
			Cond c = new Cond();
			c.u = Integer.parseInt(sa[0]) - 1;
			c.v = Integer.parseInt(sa[1]) - 1;
			c.i = i;
			conds[i] = c;
		}
		br.close();

		for (Cond c : conds) {
			dfs(c.u, -1, c.v, new ArrayList<>(), c);
		}

		long rem = 0;
		int end = 1 << m;
		for (int i = 1; i < end; i++) {
			Set<Integer> set = new HashSet<>();
			for (int j = 0; j < m; j++) {
				if ((i >> j & 1) == 1) {
					set.addAll(conds[j].visit);
				}
			}
			int num = n - 1 - set.size();
			long val = 1L << num;
			int cnt = Integer.bitCount(i);
			if (cnt % 2 == 1) {
				rem += val;
			} else {
				rem -= val;
			}
		}
		System.out.println((1L << n - 1) - rem);
	}

	static void dfs(int x, int p, int v, List<Integer> visit, Cond c) {
		if (x == v) {
			c.visit.addAll(visit);
			return;
		}
		for (Hen h : list.get(x)) {
			int next = h.a;
			if (next == x) {
				next = h.b;
			}
			if (next == p) {
				continue;
			}
			visit.add(h.i);
			dfs(next, x, v, visit, c);
			visit.remove(visit.size() - 1);
		}
	}

	static class Hen {
		int a, b, i;
	}

	static class Cond {
		int u, v, i;
		List<Integer> visit = new ArrayList<>();
	}
}
