#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define mp make_pair
#define inf (ll)1e9
#define pii pair <ll, ll>
#define fr first
#define se second
const ll mod = 998244353;
char buf[1 << 21], *p1 = buf, *p2 = buf;
#define getchar() (p1 == p2 && (p2 = (p1 = buf) + fread(buf, 1, 1 << 18, stdin), p1 == p2) ? EOF : *p1++)
inline ll read() {
	ll x = 0, f = 1;
	char ch = getchar();
	while(ch < '0' || ch > '9') f = ((ch == '-') ? -1 : f), ch = getchar();
	while(ch >= '0' && ch <= '9') x = x * 10 + ch - '0', ch = getchar();
	return x * f;
}
inline void write(ll x) {
	if(x < 0) x = -x, putchar('-');
	if(x >= 10) write(x / 10);
	putchar(x % 10 + '0');
}
inline ll quickmod(ll x, ll y) {
	ll Ans = 1;
	while(y) {
		if(y & 1) Ans = (1ll * Ans * x) % mod;
		x = (1ll * x * x) % mod;
		y >>= 1;
	}
	return Ans;
}
inline void Add(ll &x, ll y) {
	x += y;
	if(x >= mod) x -= mod;
}
inline void Dec(ll &x, ll y) {
	x -= y;
	if(x < 0) x += mod;
}
inline ll add(ll x, ll y) {
	x += y;
	if(x >= mod) x -= mod;
	return x;
}
inline ll dec(ll x, ll y) {
	x -= y;
	if(x < 0) x += mod;
	return x;
}

const int MAXN = 1e5 + 5;

int n , m;
vector <int> G[MAXN];
vector <int> WG[MAXN];

map <int , int> B[MAXN];
map <int , int> W[MAXN];

int main() {
//	freopen(".in", "r", stdin);
//	freopen(".out", "w", stdout);

	n = read() , m = read();
	for (int i = 1; i <= m; ++i) {
		int u = read() , v = read() , c = read();
		if(!c) {
			WG[u].push_back(v);
			WG[v].push_back(u);
			W[u][v] = W[v][u] = 1;
		}
		else {
			G[u].push_back(v);
			G[v].push_back(u);
			B[u][v] = B[v][u] = 1;
		}
	}
	
	int ans = n;
	for (int i = 1; i <= n; ++i) {
		for (auto v:G[i]) if(i < v) {
			if(W[i][v]) {
				ans ++;
				for (auto u:G[i]) if(u != v && W[u][v]) ans ++;
				for (auto u:G[v]) if(u != i && W[u][i]) ans ++; 
			}
		}
	}
	// Two and Three
	
	for (int i = 1; i <= n; ++i) if((int)G[i].size() == 2) { 
		int u = G[i][0] , v = G[i][1];
		if(G[u].size() > G[v].size()) swap(u , v);
		if((int)G[u].size() != 1) continue;
		if((int)G[v].size() != 2 or i > v) continue;
		int k = G[v][0] ^ G[v][1] ^ i;
		if((int)G[k].size() != 1) continue;
		
		if(W[u][v] && W[u][k] && W[i][k]) ans ++;
		if(W[u][i] && W[v][k] && W[u][k]) ans ++;
		 
	}
	
//	for (int i = 1; i <= n; ++i) if((int)G[i].size() == 3) {
//		int u = G[i][0] , v = G[i][1] , k = G[i][2];
//		if(W[u][v] && W[v][k] && W[u][k]) ans ++;
//	}
//	
//	for (int i = 1; i <= n; ++i) if((int)WG[i].size() == 3) {
//		int u = WG[i][0] , v = WG[i][1] , k = WG[i][2];
//		if(B[u][v] && B[v][k] && B[u][k]) ans ++;
//	}
//	
	write(ans);

	return 0;
}
/*
*/