#include <bits/stdc++.h>
#define N 1000009
using namespace std;
vector<int>to[N][2];

struct {
	int a, b, t, ok;
} e[N];
int id[N][2];

int find(int x, int t) {
	if (id[x][t] == x)
		return x;
	return id[x][t] = find(id[x][t], t);
}
unordered_map<long long, int>mp;

long long calc(int x) {
	return find(x, 0) * 1000000000ll + find(x, 1);
}
unordered_map<int, int>ecnt[N];
vector<int>v[N];
int n, m, ans = 0;

int main() {
	scanf("%d%d", &n, &m);
	for (int i = 1; i <= m; i++) {
		scanf("%d%d%d", &e[i].a, &e[i].b, &e[i].t);
		to[e[i].a][e[i].t].push_back(i);
		to[e[i].b][e[i].t].push_back(i);
		if (e[i].a > e[i].b)
			swap(e[i].a, e[i].b);
		ecnt[e[i].a][e[i].b]++;
	}
	for (int i = 1; i <= n; i++) {
		id[i][0] = id[i][1] = i;
		for (int t = 0; t < 2; t++) {
			//cout << i << " " << t << " " << to[i][t].size() << endl;
			if (to[i][t].size() >= 3)
				for (auto x : to[i][t])
					e[x].ok = 1;
		}
	}
	for (int i = 1; i <= m; i++) {
		if (e[i].ok == 0) {
			id[find(e[i].a, e[i].t)][e[i].t] = find(e[i].b, e[i].t);
			//cout << i << endl;
		}
	}
	for (int i = 1; i <= n; i++) {
		if (mp[calc(i)] == 0)
			mp[calc(i)] = mp.size();
		v[mp[calc(i)]].push_back(i);
		//cout << calc(i) << " ";
	}
	for (int i = 1; i <= mp.size(); i++) {
		if (v[i].size() == 1)
			ans++;
		if (v[i].size() == 2)
			ans += 3;
		if (v[i].size() == 3)
			ans += 5;
		if (v[i].size() == 4) {
			sort(v[i].begin(), v[i].end());
			bool flag = 0;
			if (ecnt[v[i][0]][v[i][1]] == 2)
				flag = 1;
			if (ecnt[v[i][0]][v[i][2]] == 2)
				flag = 1;
			if (ecnt[v[i][0]][v[i][3]] == 2)
				flag = 1;
			if (flag == 1)
				ans += 7;
			else
				ans += 5;
		}
	}
	cout << ans;
	return 0;
}
/*
9 11
1 2 0
1 2 1
2 3 0
3 4 0
3 5 0
6 7 0
7 8 0
8 9 0
6 7 1
6 9 1
8 9 1
*/