#include<iostream>
using namespace std;
int F[1010];
int f(int x){
if (F[x]==-1) return x;
return f(F[x]);
}
void bring(int a, int b){
int t1=f(a);
int t2=f(b);
if(t1!=t2) F[t1]=t2;
}
int main() {
int t,n,m;
cin>>t;
while (t--) {
cin>>n>>m;
int i,j;
for (i=1; i<=n; i++) {
F[i]=-1;
}
int a,b;
while (m--) {
cin>>a>>b;
bring(a,b);
}
int cnt=0;
for (i=1; i<=n; i++) {
if (F[i]==-1) cnt++;
}
cout<<cnt<<endl;
}
}