#include<iostream>
#include<string>
#include<vector>
#include<queue>
#include<stack>
#include<map>
#include<set>
#include<algorithm>
#include<functional>
#include<cstdio>
#include<cstdlib>
#include<cmath>
using namespace std;

#define mind(a,b) (a>b?b:a)
#define maxd(a,b) (a>b?a:b)
#define absd(x) (x<0?-(x):x)
#define pow2(x) ((x)*(x))
#define rep(i,n) for(int i=0; i<n; ++i)
#define repr(i,n) for(int i=n-1; i>=0; --i)
#define repl(i,s,n) for(int i=s; i<=n; ++i)
#define replr(i,s,n) for(int i=n; i>=s; --i)
#define repf(i,s,n,j) for(int i=s; i<=n; i+=j)
#define repe(e,obj) for(auto e : obj)

#define SP << " " <<
#define COL << " : " <<
#define COM << ", " <<
#define ARR << " -> " <<
#define PNT(STR) cout << STR << endl
#define POS(X,Y) "(" << X << ", " << Y << ")"
#define DEB(A) " (" << #A << ") " << A
#define DEBREP(i,n,val) for(int i=0; i<n; ++i) cout << val << " "; cout << endl
#define ALL(V) (V).begin(), (V).end()
#define INF 1000000007
#define INFLL 10000000000000000007LL
#define EPS 1e-9

typedef unsigned int uint;
typedef unsigned long ulong;
typedef unsigned long long ull;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> P;
//typedef pair<ll, ll> P;
typedef pair<P, int> PI;
typedef pair<int, P> IP;
typedef pair<P, P> PP;
typedef priority_queue<P, vector<P>, greater<P> > pvqueue;


#define N 100000

vector<int> g[N];
bool used[N];

int main() {
  int n, m;
  cin >> n >> m;
  if(n > N) exit(1);
  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(!used[i]) {
      queue<int> que;
      used[i] = true;
      que.push(i);
      ++ans;
      while(!que.empty()) {
        int v = que.front(); que.pop();
        rep(j, g[v].size()) {
          int t = g[v][j];
          if(!used[t]) {
            used[t] = true;
            que.push(t);
          }
        }
      }
    }
  }
  cout << ans << endl;

  return 0;
}