#include<iostream>#include<cstring>#include<algorithm>#pragma warning(disable: 4996)usingnamespace std;constint NN =1000+5;int a[NN];intmain(){int t, n, m, x, y, num;
cin >> t;while(t--){
num =1;
cin >> n >> m;for(int i =0; i <= n; i++)
a[i]= i;for(int i =0; i < m; i++){scanf("%d %d",&x,&y);
x = a[x];
y = a[y];for(int j =1; j <= n; j++)if(a[j]== x || a[j]== y)
a[j]= x;}sort(a +1, a + n +1);//排好序直接看有多少各不同“类别”的,就是多少个集合for(int i =2; i <= n; i++)if(a[i]!= a[i -1])
num++;
cout << num << endl;}return0;}