Problem:
Score : 600 points

Problem Statement

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.

Sample Input 1

3
1 2
2 3
1
1 3

Sample Output 1

3

The tree in this input is shown below:

All of the M restrictions will be satisfied if Edge 1 and 2 are respectively painted (white, black), (black, white), or (black, black), so the answer is 3.

Sample Input 2

2
1 2
1
1 2

Sample Output 2

1

The tree in this input is shown below:

All of the M restrictions will be satisfied only if Edge 1 is painted black, so the answer is 1.

Sample Input 3

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

Sample Output 3

9

The tree in this input is shown below:

Sample Input 4

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

Sample Output 4

62

The tree in this input is shown below:

Solution in Ruby (2.3.3) (judge verdict: Wrong Answer)

#スタックで深さ優先探索
def dfs(start, goal, g, pre)
  stack = [ [start, 0, pre] ]
  #stack = [探索する頂点番号, 使用した辺の記録, １つ手前の頂点]
  catch(:loop) do
    while stack.length > 0 do
      current = stack.pop
      #ゴールなら終了
      if current[0] == goal
        @path = current[1]
        throw :loop
      end
      g[ current[0] ].each do |p|
        #戻るなら追加しない
        next if p[0] == current[2]
        #スタックに追加
        bit = current[1] | (1 << p[1])
        stack.push([p[0], bit, current[0]])
      end
    end
  end
end

def main
  n = gets.chomp.to_i
  graph = []

  (n-1).times do |i|
    a, b = gets.chomp.split.map(&:to_i)
    
    graph[a] = [] if !graph[a]
    graph[b] = [] if !graph[b]
    graph[a].push([b, i])
    graph[b].push([a, i])
  end

  m = gets.chomp.to_i
  paths = []
  m.times do |i|
    @path = 0
    x, y = gets.chomp.split.map(&:to_i)
    dfs(x, y, graph, -1)
    paths.push(@path)
  end

  #回答の導出
  ans = 0
  #回答の導出
  (1..m).each do |i|
    paths.combination(i).each do |cm|
      bit = cm.inject(:|).to_s(2).count('1')
      ans += bit.odd? ? 1 * (1 << (n - 1 - bit)) : -1 * (1 << (n - 1 - bit))
    end
  end

  puts (1 << (n -1)) + ans

end

main