There is a city with $N$ numbered $0 - N-1$ shops. A market is a place where we can reach from one shop to another using some road. There are $M$ roads in this city connecting each connecting any two shops. 
Find the number of markets in the city.
NOTE:  A market having only one shop is also a valid market.

-----Input:-----
- First line will contain $T$, number of testcases. Then the testcases follow. 
- First line of Each Test Case is $N, M$, denoting the number of shops and the number of roads respectively.
- Next M lines consist of two integers $A$ and $B$ denoting that there exists a road between Shop A and Shop B

-----Output:-----
For each testcase, output the number of markets.

-----Constraints-----
- $1 \leq T \leq 100$
- $1 \leq N,M \leq 10^3$
- $0 \leq A,B < N$

-----Sample Input:-----
1
5 3
0 1
2 3
3 4

-----Sample Output:-----
2

```python

USER_FILENAME = "<user_code>"
import sys, json, builtins
import math, heapq, bisect, itertools, functools, collections, statistics, fractions, decimal, operator, array, random, re, string, os, pathlib
try:
    import resource as _res
except Exception:
    _res = None
from collections import Counter, defaultdict, deque, OrderedDict
from functools import lru_cache, reduce
from itertools import accumulate, permutations, combinations, product
from math import gcd, ceil, floor, sqrt
from decimal import Decimal
try:
    from typing import *
except Exception:
    pass
try:
    sys.setrecursionlimit(1_000_000)
except Exception:
    pass
try:
    import site as _site
    try:
        _sys_sites = _site.getsitepackages() if hasattr(_site, "getsitepackages") else []
        for _p in _sys_sites:
            if _p and _p not in sys.path:
                sys.path.append(_p)
    except Exception:
        pass
    try:
        _usp = _site.getusersitepackages()
        if isinstance(_usp, str):
            _usp = [_usp]
        for _p in _usp:
            if _p and _p not in sys.path:
                sys.path.append(_p)
    except Exception:
        pass
except Exception:
    pass

ns = {"__name__": "__main__"}
for _k, _v in list(globals().items()):
    if not _k.startswith("_"):
        ns[_k] = _v
_CODE = 'class Graph: \n    def __init__(self,V): \n        self.V = V \n        self.adj = [[] for i in range(V)] \n  \n    def DFSUtil(self, temp, v, visited): \n  \n        # Mark the current vertex as visited \n        visited[v] = True\n  \n        # Store the vertex to list \n        temp.append(v) \n  \n        # Repeat for all vertices adjacent \n        # to this vertex v \n        for i in self.adj[v]: \n            if visited[i] == False: \n                  \n                # Update the list \n                temp = self.DFSUtil(temp, i, visited) \n        return temp \n    \n    def addEdge(self, v, w): \n        self.adj[v].append(w) \n        self.adj[w].append(v) \n  \n    # Method to retrieve connected components \n    # in an undirected graph \n    def connectedComponents(self): \n        visited = [] \n        cc = [] \n        for i in range(self.V): \n            visited.append(False) \n        for v in range(self.V): \n            if visited[v] == False: \n                temp = [] \n                cc.append(self.DFSUtil(temp, v, visited)) \n        return cc \n  \n# Driver Code \nfor _ in range(int(input())):\n      \n    n, m = map(int, input().split())\n    g = Graph(n); \n    for _ in range(m):\n        x, y = map(int, input().split())\n        g.addEdge(x, y) \n    \n    cc = g.connectedComponents() \n    print(len(cc)) '
_co = compile(_CODE, USER_FILENAME, "exec")
exec(_co, ns, ns)

```

Measured memory_bytes: 16351