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

using LL = long long;

const int N = 301000;

int n, m;
int a[N];

int red[N],blue[N];

int find(int p[], int x){
 if(x != p[x]) p[x] = find(p, p[x]);
 return p[x];
}

void merge(int p[], int x, int y){
 int a = find(p, x), b = find(p, y);
 if(a == b) return;
 p[a] = b;
}
using PII = pair<int,int>;
void solve(){

 cin >> n >> m;
 int res = n;
 if(n == 1){
  cout << 1 << "\n";
  return;
 }
 else if(n == 2){
  if(m == 2) res ++;
  cout << res << "\n";
  return;
 }

 vector<vector<int>>node(n+1);
 for(int i = 1;i <= n;++i){
  red[i] = i;
  blue[i] = i;
 }
 int ans = n;
 set<PII>S;

 for(int i = 1; i <= m; i ++){
  int a,b,c;
  cin >> a >> b >> c;
  if(a > b)swap(a,b);
  if(S.count({a,b}))ans++;
  node[a].push_back(b);
  node[b].push_back(a);
  if(c == 0){merge(red,a,b);}
  else {merge(blue,a,b);}
  S.insert({a,b});
 }
 // cout << ans << endl;
 vector<bool>vis(n+1);
 int cnt = 0;
 set<int>Sr,Sb;
 auto dfs = [&](auto dfs,int u) -> void{
  if(vis[u])return;
  vis[u] = 1;
  Sr.insert(find(red,red[u]));
  Sb.insert(find(blue,blue[u]));
  cnt++;
  for(auto v : node[u]){
   dfs(dfs,v);
  }
 };

 // for(int i = 1;i <= n;++i){
 //  cout << red[i] << " " << blue[i] << endl;
 // }
 for(int i = 1;i <= n;++i){
  if(vis[i] == 0){
   cnt = 0;Sr.clear();Sb.clear();
   dfs(dfs,i);
   // cout << Sr.size() << " " << Sb.size() << endl;
   if(cnt - Sr.size() >= 2 && cnt - Sb.size() >= 2)ans++;
  }
 }
 cout << ans << endl;
}

signed main(){
 ios::sync_with_stdio(0);
 cin.tie(0);
 cout.tie(0);
 int _ = 1;
 // cin >> _;
 while(_--){
  solve();
 }
}

/*
1
10 40 50

1
60 200 960
 */