Problem: 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

Solution (in JAVA):

Solution:
import java.io.*;
import java.util.*;
import java.util.spi.LocaleNameProvider;

class Main {

	private static class Edge {
		public int to, id;

		public Edge(int to, int id) {
			this.to = to;
			this.id = id;
		}
	}

	private static List<Edge>[] G;

	private static List<Integer> dfs(int v, int t, int p) {
		if (v == t) return new ArrayList<>();
		for (Edge e : G[v]) {
			if (e.to == p) continue;
			List<Integer> a = dfs(e.to, t, v);
			if (a != null) {
				a.add(e.id);
				return a;
			}
		}
		return null;
	}

	public static void main(String[] args) throws Exception {
		final Scanner sc = new Scanner(System.in);
		int N = sc.nextInt();
		G = new ArrayList[N];
		for (int i = 0; i < N; i++) {
			G[i] = new ArrayList<>();
		}

		for (int i = 0; i < N - 1; i++) {
			int a = sc.nextInt() - 1;
			int b = sc.nextInt() - 1;
			G[a].add(new Edge(b, i));
			G[b].add(new Edge(a, i));
		}

		int M = sc.nextInt();
		long[] s = new long[M];
		for (int i = 0; i < M; i++) {
			int a = sc.nextInt() - 1;
			int b = sc.nextInt() - 1;
			List<Integer> ids = dfs(a, b, -1);
			assert ids != null;
			for (Integer id : ids) {
				s[i] |= 1L << id;
			}
		}

		long answer = 0;
		for (int i = 0; i < 1 << M; i++) {
			long mask = 0;
			for (int j = 0; j < M; j++) {
				if (((i >> j) & 1) == 1) {
					mask |= s[j];
				}

				int white = Long.bitCount(mask);
				long x = 1L << (N - 1 - white);
				if (Long.bitCount(i) % 2 == 0) {
					answer += x;
				} else {
					answer -= x;
				}
			}
		}

		System.out.println(answer);
	}
}