#include <bits/stdc++.h>
#define REP(i, n)     for(int i = 0;i < n;i++)
#define REPR(i, n)    for(int i = n;i >= 0;i--)
#define FOR(i, m, n)  for(int i = m;i < n;i++)
#define FORR(i, m, n) for(int i = m;i >= n;i--)
#define SORT(v, n) sort(v, v+n);
#define VSORT(v) sort(v.begin(), v.end());
#define VRSORT(v) sort(v.begin(), v.end(),greater<int>());
#define ALL(X) (X).begin(),(X).end()
#define INF 99999999
#define M_PI 3.14159265358979323846
#define MOD 1000000007

#ifdef __LOCAL
    #define DBG(X) cout << #X << " = " << (X) << endl;
    #define SAY(X) cout << (X) << endl;
#else
    #define DBG(X)
    #define SAY(X)
#endif

#ifdef __LOCAL
    #include <filesystem>
    namespace fs = std::filesystem;
#endif

using namespace std;

using ll = long long int;
using ull = unsigned long long int;
using ld = long double;
using pii = pair<int, int>;
using pll = pair<ll, ll>;

int dx[]={1, 0, -1, 0, 0};
int dy[]={0, 1, 0, -1, 0};
const int INT_INF = (int)(2e9);
const ll  LL_INF = (ll)(2e18);
const int NIL = -1;
static mt19937 _g(time(nullptr));
 
std::string pad(int num){ char buffer[4]; std::snprintf(buffer, sizeof(buffer), "%03d", num); return buffer;}
inline ll randint(ll a, ll b) { ll w = (_g() << 31LL) ^ _g(); return a + w % (b - a + 1); }
inline void fast_io() { ios_base::sync_with_stdio(false); cin.tie(nullptr); cout.tie(nullptr); };
template<typename T> inline T sign(T x) { return T(x > 0) - T(x < 0); }
template<typename T, typename S> inline ostream& operator<<(ostream& os, const pair<T, S> p) { cout << "[" << p.first << ";" << p.second << "]"; return os; }
template<typename T> inline ostream& operator<<(ostream& os, const vector<T>& v) { for (auto el : v) os << el << " "; return os; }
template<typename T> inline T fetch() { T ret; cin >> ret; return ret; }
template<typename T> inline vector<T> fetch_vec(int sz) { vector<T> ret(sz); for (auto& elem : ret) cin >> elem; return ret; }

class Union{
  private:
    int N;
    std::map<int,int> parent;
    std::map<int,int> rank;
  public:
    Union(int const& n=100);
    int find_root(int const& x);
    void unite(int x, int y);
    bool same(int const& x, int const& y);
};

// 初期化
// コンストラクタ
Union::Union(int const& n){
  N = n;
  for(int i=0;i<n;i++){
    parent[i]=i;
    rank[i]=0;
  }
}

// 木の根を求める
int Union::find_root(int const& x){
  if(x >= N) return N;
  if(parent[x]==x){
    return x;
  } else {
    return parent[x] = find_root(parent[x]);
  }
}

// x と y の属する集合を合併
void Union::unite(int x, int y){
  x = find_root(x);
  y = find_root(y);
  if(x == y) return;
  if(rank[x] < rank[y]){
    parent[x] = y;
  } else {
    parent[y] = x;
    if(rank[x] == rank[y]) rank[x]++;
  }
}

// x と y が同じ集合に属するか否か。
bool Union::same(int const& x, int const& y){
  return (Union::find_root(x) == Union::find_root(y));
}


int N,M;
vector<int> X,Y,Z;

void input(){
  #ifdef __LOCAL
      fs::path p = __FILE__;
      fs::path input,output;
      input = output = p.parent_path();
      input += string("/input/") + string(p.stem()) + string(".txt");
      output += string("/output/") + string(p.stem()) + string(".txt");
      freopen(input.c_str(), "r", stdin);
      freopen(output.c_str(), "w", stdout);
  #endif

  fast_io();
  cin >> N >> M;
  X.assign(M,0);
  Y.assign(M,0);
  Z.assign(M,0);
  REP(i,M){
    cin >> X[i] >> Y[i] >> Z[i];
    X[i]--;
    Y[i]--;
  }
}


int solve(){
  input();
  set<int> C;
  Union UF(N);
  REP(i,M) UF.unite(X[i],Y[i]);
  REP(i,N) C.insert(UF.find_root(i));
  int ans=0;
  ans = C.size();
  cout << ans << endl;
  return 0;
}

int main()
{
  solve();
  return 0;
}


Measured memory_bytes: 15488