Counting Graphs

문제

Bessie has a connected, undirected graph $GG$ with $NN$ vertices labeled $1\dots N1\backslash ldots\; N$ and $MM$ edges ($2\le N\le {10}^2,N-1\le M\le \frac{N^2+N}{2}2\backslash le\; N\backslash le\; 10^2,\; N-1\backslash le\; M\backslash le\; \backslash frac\{N^2+N\}\{2\}$). $GG$ may contain self-loops (edges from nodes back to themselves), but no parallel edges (multiple edges connecting the same endpoints).

Let $f_G(a,b)f\_G(a,b)$ be a boolean function that evaluates to true if there exists a path from vertex $11$ to vertex $aa$ that traverses exactly $bb$ edges for each $1\le a\le N1\backslash le\; a\backslash le\; N$ and $0\le b0\backslash le\; b$, and false otherwise. If an edge is traversed multiple times, it is included that many times in the count.

Elsie wants to copy Bessie. In particular, she wants to construct an undirected graph $G^{\mathrm{\prime }}G\text{'}$ such that $f_{G^{\mathrm{\prime }}}(a,b)=f_G(a,b)f\_\{G\text{'}\}(a,b)=f\_G(a,b)$ for all $aa$ and $bb$.

Your job is to count the number of distinct graphs $G^{\mathrm{\prime }}G\text{'}$ that Elsie may create, modulo ${10}^9+710^9+7$. As with $GG$, $G^{\mathrm{\prime }}G\text{'}$ may contain self-loops but no parallel edges (meaning that there are $2^{\frac{N^2+N}{2}}2^\{\backslash frac\{N^2+N\}\{2\}\}$ distinct graphs on $NN$ labeled vertices in total).

Each input contains $TT$ ($1\le T\le \frac{{10}^5}{4}1\backslash le\; T\backslash le\; \backslash frac\{10^5\}\{4\}$) test cases that should be solved independently. It is guaranteed that the sum of $N^{2}N^2$ over all test cases does not exceed ${10}^{5}10^5$.

입력

The first line of the input contains $TT$, the number of test cases.

The first line of each test case contains the integers $NN$ and $MM$.

The next $MM$ lines of each test case each contain two integers $xx$ and $yy$ ($1\le x\le y\le N1\backslash le\; x\backslash le\; y\backslash le\; N$), denoting that there exists an edge between $xx$ and $yy$ in $GG$.

Consecutive test cases are separated by newlines for readability.

출력

For each test case, the number of distinct $G^{\mathrm{\prime }}G\text{'}$ modulo ${10}^9+710^9+7$ on a new line.

1

5 4
1 2
2 3
1 4
3 5

3

7

4 6
1 2
2 3
3 4
1 3
2 4
1 4

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

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

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

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

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

22 28
1 2
2 3
3 4
4 5
5 6
6 7
1 7
1 8
3 9
8 10
10 11
10 12
10 13
10 14
11 15
12 16
13 17
14 18
9 15
9 16
9 17
9 18
15 19
19 20
15 20
16 21
21 22
16 22

45
35
11
1
15
371842544
256838540