#include <iostream>
using namespace std;
const int N = 1010;
int f[N];
int t, n, m;
int find (int x)
{
if (f[x]!=x) f[x] = find(f[x]);
return f[x];
}
int main()
{
scanf("%d", &t);
while (t--)
{
scanf("%d %d", &n, &m);
int x, y;
int w = 0;
for (int i=1;i<=n;++i) f[i] = i;
for (int i=0;i<m;++i)
{
scanf("%d %d", &x, &y);
x = find(x);
y = find(y);
if (x>y) swap(x, y);
if (x!=y)
{
++w;
f[y] = x;
}
}
printf("%d\n", n-w);
}
return 0;
}
07-25