HDU 1213

#include<iostream>
using namespace std;
const int maxn=1005;
struct Node
{
	int parent;//保存父节点
	int rank;//以此为父节点的人数
}people[maxn];

void init(int n)
{
	int i;
	for(i=0;i<=n;i++)
	{
		people[i].parent=i;
		people[i].rank=1;
	}
}

int find(int a)
{
	int t;
	t=people[a].parent;
	if(t!=a)
	{
		people[a].parent=find(t);
	}
	return people[a].parent;
}

void Union(int a,int b)
{
	int fa,fb;
	fa=find(a);
	fb=find(b);
	if(fa!=fb)
	{
		people[fa].parent=fb;
		people[fb].rank+=people[fa].rank;
	}
}

int Count(int n)
{
	int i;
	int cnt=0;
	for(i=1;i<=n;i++)
	{
		if(people[i].parent==i)
			cnt++;
	}
	return cnt;
}

int main(void)
{
	int tcase;
	int n,m,a,b;
	while(scanf("%d",&tcase)!=EOF)
	{
		while(tcase--)
		{
			scanf("%d%d",&n,&m);
			init(n);
			while(m--)
			{
				scanf("%d%d",&a,&b);
				Union(a,b);
			}
			printf("%d\n",Count(n));
		}
	}
	return 0;
}