[SWEA] 그룹 나누기

def Find(x):
    if P[x] != x:
        P[x] = Find(P[x])
    return P[x]


def Union(a, b):
    Pa = Find(a)
    Pb = Find(b)
    P[Pb] = Pa


T = int(input())
for TC in range(T):
    N, M = map(int, input().split())
    P = [i for i in range(N+1)]
    arr = list(map(int, input().split()))
    ans = 0
    q = []

    for i in range(0, len(arr), 2):
        if Find(arr[i]) == Find(arr[i+1]):
            continue
        Union(arr[i], arr[i+1])

    for i in range(1, N + 1):
        if i == P[i]:
            ans += 1

    print('#{} {}'.format(TC+1, ans))