Virtual contest is a way to take part in past contest, as close as possible to participation on time. It is supported only ICPC mode for virtual contests.
If you've seen these problems, a virtual contest is not for you - solve these problems in the archive.
If you just want to solve some problem from a contest, a virtual contest is not for you - solve this problem in the archive.
Never use someone else's code, read the tutorials or communicate with other person during a virtual contest.

No tag edit access

F. Tree nesting

time limit per test

2 secondsmemory limit per test

256 megabytesinput

standard inputoutput

standard outputYou are given two trees (connected undirected acyclic graphs) *S* and *T*.

Count the number of subtrees (connected subgraphs) of *S* that are isomorphic to tree *T*. Since this number can get quite large, output it modulo 10^{9} + 7.

Two subtrees of tree *S* are considered different, if there exists a vertex in *S* that belongs to exactly one of them.

Tree *G* is called isomorphic to tree *H* if there exists a bijection *f* from the set of vertices of *G* to the set of vertices of *H* that has the following property: if there is an edge between vertices *A* and *B* in tree *G*, then there must be an edge between vertices *f*(*A*) and *f*(*B*) in tree *H*. And vice versa — if there is an edge between vertices *A* and *B* in tree *H*, there must be an edge between *f* ^{ - 1}(*A*) and *f* ^{ - 1}(*B*) in tree *G*.

Input

The first line contains a single integer |*S*| (1 ≤ |*S*| ≤ 1000) — the number of vertices of tree *S*.

Next |*S*| - 1 lines contain two integers *u* _{ i} and *v* _{ i} (1 ≤ *u* _{ i}, *v* _{ i} ≤ |*S*|) and describe edges of tree *S*.

The next line contains a single integer |*T*| (1 ≤ |*T*| ≤ 12) — the number of vertices of tree *T*.

Next |*T*| - 1 lines contain two integers *x* _{ i} and *y* _{ i} (1 ≤ *x* _{ i}, *y* _{ i} ≤ |*T*|) and describe edges of tree *T*.

Output

On the first line output a single integer — the answer to the given task modulo 10^{9} + 7.

Examples

Input

5

1 2

2 3

3 4

4 5

3

1 2

2 3

Output

3

Input

3

2 3

3 1

3

1 2

1 3

Output

1

Input

7

1 2

1 3

1 4

1 5

1 6

1 7

4

4 1

4 2

4 3

Output

20

Input

5

1 2

2 3

3 4

4 5

4

4 1

4 2

4 3

Output

0

Codeforces (c) Copyright 2010-2020 Mike Mirzayanov

The only programming contests Web 2.0 platform

Server time: Aug/14/2020 12:21:32 (h1).

Desktop version, switch to mobile version.

Supported by

User lists

Name |
---|