#include <bits/stdc++.h>
using namespace std;

class union_find {
	vector<int> par;
public:
	union_find(int n) : par(n, -1) {}
	int find(int a) {
		return par[a] < 0 ? a : par[a] = find(par[a]);
	}
	bool same(int a, int b) {
		return find(a) == find(b);
	}
	void unite(int a, int b) {
		a = find(a);
		b = find(b);
		if (a == b) return;
		if (par[a] < par[b]) {
			par[a] += par[b];
			par[b] = a;
		}
		else {
			par[b] += par[a];
			par[a] = b;
		}
	}
};

int main()
{
	int N, M;
	cin >> N >> M;
	union_find uf(N);
	for (int i = 0; i < M; i++) {
		int a, b, c;
		cin >> a >> b >> c; --a, --b;
		uf.unite(a, b);
	}
	int res = 0;
	for (int i = 0; i < N; i++) res += uf.find(i) == i;
	cout << res << endl;
	return 0;
}