并查集模板

//#include <bits/stdc++.h>
#include <iostream>
using namespace std;
const int N = 1010;
int b[N+1];

void init()
{//初始化
    for(int i=1; i<=N; i++) {
        b[i] = i;
    }
}

int find_set(int x)
{//查找
    if(x != b[x]) b[x] = find_set(b[x]);
    return b[x];
}

int find_plus(int x)
{//非递归查找
    int r = x;
    while(r != b[r]) r = b[r];//查找根节点
    
    int i = x, j;
    while(i != r) {
        j = b[i];
        b[i] = r;//把路径上元素的集改为根节点
        i = j;
    }
    
    return r;
}

void union_set(int x, int y)
{//合并
    x = find_set(x); y = find_set(y);
    if(x != y) b[x] = b[y];
}

int h[N+1];
void union_plus(int x, int y)
{//优化合并
    x = find_set(x); y = find_set(y);
    if(h[x] == h[y]) {
        h[x] = h[x] + 1;//合并，数高加1
        b[y] = x;
    }
    else {
        if(h[x] < h[y]) b[x] = y;//矮树并高树
        else b[y] = x;
    }
}

///hdu1213 题板
int main()
{
    int t; cin >> t;
    while(t--) {
        init();
        int n, m; cin >> n >> m;
        for(int i=1; i<=m; i++) {
            int l, r; cin >> l >> r;
            //if(b[find_set(l)] != b[find_set(r)]) 
                union_set(l, r);
        }
        
        int ans = 0;//统计并查集数列
        for(int i=1; i<=n; i++) {
            if(b[i] == i) ans++;
        }
        cout << ans << endl;
    }
    return 0;
}