#include <iostream>
#include <algorithm>
#include <cmath>
#include <vector>
#include <complex>
#include <queue>
#include <deque>
#include <set>
#include <map>
#include <unordered_set>
#include <unordered_map>
#include <iomanip>
#include <assert.h>
#include <array>
#include <cstdio>
#include <cstring>
#include <random>
#include <functional>
#include <numeric>
#include <bitset>

using namespace std;

#define REP(i,a,b) for(int i=a;i<(int)b;i++)
#define rep(i,n) REP(i,0,n)
#define all(c) (c).begin(), (c).end()
#define zero(a) memset(a, 0, sizeof a)
#define minus(a) memset(a, -1, sizeof a)
template<class T1, class T2> inline bool minimize(T1 &a, T2 b) { return b < a && (a = b, 1); }
template<class T1, class T2> inline bool maximize(T1 &a, T2 b) { return a < b && (a = b, 1); }

typedef long long ll;
int const inf = 1<<29;

vector<int> g[100001];
bool vis[100001];

int main() {

  int N, M; cin >> N >> M;
  rep(i, M) {
    int a, b, c; cin >> a >> b >> c;
    a--, b--;
    g[a].push_back(b);
    g[b].push_back(a);
  }

  int ans = 0;
  rep(i, N) {
    if(vis[i]) { continue; }
    ans ++;
    queue<int> q;
    q.emplace(i);
    while(!q.empty()) {
      auto p = q.front(); q.pop();
      for(auto && e: g[p]) {
        if(vis[e]) { continue; }
        vis[e] = 1;
        q.emplace(e);
      }
    }
  }

  cout << ans << endl;

  return 0;
}