// Slower C++ solution:
#include <iostream>

#include<vector>

#include<set>

#include<queue>

#include<map>

#include<algorithm>

#include<cstring>

#include<string>

#include<cassert>

#include<cmath>

#include<climits>

#include<iomanip>



using namespace std;



#define MOD 1000000007

#define REP(i,n) for(int (i)=0;(i)<(n);(i)++)

#define FOR(i,c) for(decltype((c).begin())i=(c).begin();i!=(c).end();++i)

#define ll long long

#define ull unsigned long long

#define all(hoge) (hoge).begin(),(hoge).end()

const long long INF = 1LL << 60;

typedef vector<ll> Array;

typedef vector<Array> Matrix;



//グラフ関連

struct Edge {//グラフ

	ll to, cap, rev;

	Edge(ll _to, ll _cap, ll _rev) {

		to = _to; cap = _cap; rev = _rev;

	}

};

typedef vector<Edge> Edges;

typedef vector<Edges> Graph;

void add_edge(Graph& G, ll from, ll to, ll cap) {//最大フロー求める Ford-fulkerson

	G[from].push_back(Edge(to, cap, (ll)G[to].size()));

	G[to].push_back(Edge(from, cap, (ll)G[from].size() - 1));//最小カットの場合逆辺は0にする

}

ll max_flow_dfs(Graph & G, ll v, ll t, ll f, vector<bool> & used)

{

	if (v == t)

		return f;

	used[v] = true;

	for (int i = 0; i < G[v].size(); ++i) {

		Edge& e = G[v][i];

		if (!used[e.to] && e.cap > 0) {

			ll d = max_flow_dfs(G, e.to, t, min(f, e.cap), used);

			if (d > 0) {

				e.cap -= d;

				G[e.to][e.rev].cap += d;

				return d;

			}

		}

	}

	return 0;

}

ll max_flow(Graph & G, ll s, ll t)

{

	ll flow = 0;

	for (;;) {

		vector<bool> used(G.size());

		REP(i, used.size())used[i] = false;

		ll f = max_flow_dfs(G, s, t, INF, used);

		if (f == 0) {

			return flow;

		}

		flow += f;

	}

}



template<class T> inline bool chmin(T & a, T b) {

	if (a > b) {

		a = b;

		return true;

	}

	return false;

}

template<class T> inline bool chmax(T & a, T b) {

	if (a < b) {

		a = b;

		return true;

	}

	return false;

}



class UnionFind {

	vector<int> data;

public:

	UnionFind(int size) : data(size, -1) { }

	bool unionSet(int x, int y) {

		x = root(x); y = root(y);

		if (x != y) {

			if (data[y] < data[x]) swap(x, y);

			data[x] += data[y]; data[y] = x;

		}

		return x != y;

	}

	bool findSet(int x, int y) {

		return root(x) == root(y);

	}

	int root(int x) {

		return data[x] < 0 ? x : data[x] = root(data[x]);

	}

	int size(int x) {

		return -data[root(x)];

	}

};



//約数

void divisor(ll n, vector<ll>& ret) {

	for (ll i = 1; i * i <= n; i++) {

		if (n % i == 0) {

			ret.push_back(i);

			if (i * i != n) ret.push_back(n / i);

		}

	}

	sort(ret.begin(), ret.end());

}



//nCrとか

class Combination {

public:

	Array fact;

	Array inv;

	ll mod;

	ll mod_inv(ll x) {

		ll n = mod - 2;

		ll res = 1LL;

		while (n > 0) {

			if (n & 1) res = res * x % mod;

			x = x * x % mod;

			n >>= 1;

		}

		return res;

	}

	ll nCr(ll n, ll r) {

		return ((fact[n] * inv[r] % mod) * inv[n - r]) % mod;

	}

	ll nPr(ll n, ll r) {

		return (fact[n] * inv[n - r]) % mod;

	}

	Combination(ll n, ll _mod) {

		mod = _mod;

		fact.resize(n + 1);

		fact[0] = 1;

		REP(i, n) {

			fact[i + 1] = (fact[i] * (i + 1LL)) % mod;

		}

		inv.resize(n + 1);

		REP(i, n + 1) {

			inv[i] = mod_inv(fact[i]);

		}

	}

};



bool compare_by_b(pair<ll, ll> a, pair<ll, ll> b) {//降順second

	if (a.second != b.second) {

		return a.second > b.second;

	}

	else {

		return a.first > b.first;

	}

}



bool compare_by_a(pair<ll, ll> a, pair<ll, ll> b) {//降順first

	if (a.first != b.first) {

		return a.first > b.first;

	}

	else {

		return a.second > b.second;

	}

}



//最大公約数

ll gcd(ll m, ll n) {

	if (n == 0)return m;

	return gcd(n, m % n);

}//gcd



//最小公倍数

ll lcm(ll m, ll n) {

	return m / gcd(m, n) * n;

}





//input

int N,M,K,A,B,C;

string S;

vector<vector<pair<ll,ll>>> vec(100010);

vector<ll> ans(100010, -1);







int main()

{	

	cin >> N >> M;

	UnionFind tree(N);

	vector<ll> ans(N, -1);

	REP(i, M) {

		ll x, y, z;

		cin >> x >> y >> z;

		x--;

		y--;

		tree.unionSet(x, y);

		

	}

	ll count = 0;

	for (int i = 0; i < N;i++) {

		if (tree.root(i)==i) {

			count++;

		}

		//cout << tree.root(i) << endl;

	}

	cout << count << endl;





	return 0;

}


// Faster C++ solution for the same problem (measured speedup: 4.451146291691621x):
#include <bits/stdc++.h>

using namespace std;



#define rep(i, m, n) for(int(i) = (int)(m); i < (int)(n); ++i)

#define rep2(i, m, n) for(int(i) = (int)(n)-1; i >= (int)(m); --i)

#define REP(i, n) rep(i, 0, n)

#define REP2(i, n) rep2(i, 0, n)

#define all(hoge) (hoge).begin(), (hoge).end()

#define en '\n'

using ll = long long;

using ull = unsigned long long;

template <class T>

using vec = vector<T>;

template <class T>

using vvec = vector<vec<T>>;

typedef pair<ll, ll> P;

constexpr long long INF = 1LL << 60;

constexpr int INF_INT = 1 << 25;

//constexpr long long MOD = (ll)1e9 + 7;

constexpr long long MOD = 998244353LL;

using ld = long double;

static const ld pi = 3.141592653589793L;

typedef vector<ll> Array;

typedef vector<Array> Matrix;



template <class T>

inline bool chmin(T &a, T b) {

    if(a > b) {

        a = b;

        return true;

    }

    return false;

}

template <class T>

inline bool chmax(T &a, T b) {

    if(a < b) {

        a = b;

        return true;

    }

    return false;

}



struct Edge {

    ll to, rev;

    long double cap;

    Edge(ll _to, long double _cap, ll _rev) {

        to = _to;

        cap = _cap;

        rev = _rev;

    }

};

using Edges = vector<Edge>;

using Graph = vector<Edges>;



void add_edge(Graph &G, ll from, ll to, long double cap, bool revFlag,

              long double revCap) {

    G[from].push_back(Edge(to, cap, (ll)G[to].size()));

    if(revFlag)

        G[to].push_back(Edge(from, revCap, (ll)G[from].size() - 1));

}



class UnionFind {

    vector<int> data;

    int num;



  public:

    UnionFind(int size) : data(size, -1), num(size) {}

    bool unionSet(int x, int y) {

        x = root(x);

        y = root(y);

        if(x != y) {

            if(data[y] < data[x])

                swap(x, y);

            data[x] += data[y];

            data[y] = x;

            num--;

        }

        return x != y;

    }

    bool findSet(int x, int y) {

        return root(x) == root(y);

    }

    int root(int x) {

        return data[x] < 0 ? x : data[x] = root(data[x]);

    }

    int size(int x) {

        return -data[root(x)];

    }

    int numSet() {

        return num;

    }

};



void solve() {

    ll n, m;

    cin >> n >> m;

    UnionFind uni(n);

    REP(i, m) {

        ll x, y, z;

        cin >> x >> y >> z;

        uni.unionSet(--x, --y);

    }

    cout << uni.numSet() << en;

}



int main() {

    ios::sync_with_stdio(false);

    cin.tie(0);

    cout.tie(0);



    solve();

    // ll t;cin>>t;REP(i,t) solve();



    return 0;

}