Connected or Not Connected

There is a world containing $n$ sites that are interconnected by a number of (virtual) pathways. Each pathway is a bi-directional connection between two sites: if there is a connection between site $a$ and site $b$, then you can travel from $a$ to $b$ and from $b$ to $a$.

Using only the given connections, decide whether there is a path from every site to every other site — that is, whether the graph is connected as a single whole.

The first line contains the number of test cases $T$ ($T \le 50$).

Each of the following lines contains one test case. The first number in a test case is the number of sites $n$ ($n \le 100$); the sites are numbered from $0$ to $n-1$. The second number is the number of connections $k$ ($k \le 200$). After that come $k$ connections, each given as a pair of integers.

Connections may repeat, and there may be self-connections (a connection from a site to itself).

For each test case, check whether there is a path from every site to every other site, and print Connected. if so, or Not connected. otherwise, on its own line.