#include <bits/stdc++.h>

struct DSU 
{
    std::vector<int> f, siz;
    
    DSU() {}
    DSU(int n) 
    {
        init(n);
    }
    
    void init(int n) 
    {
        f.resize(n);
        std::iota(f.begin(), f.end(), 0);
        siz.assign(n, 1);
    }
    
    int find(int x) 
    {
        while (x != f[x]) 
        {
            x = f[x] = f[f[x]];
        }
        return x;
    }
    
    bool same(int x, int y) 
    {
        return find(x) == find(y);
    }
    
    bool merge(int x, int y) 
    {
        x = find(x);
        y = find(y);
        if (x == y) {
            return false;
        }
        siz[x] += siz[y];
        f[y] = x;
        return true;
    }
    
    int size(int x) 
    {
        return siz[find(x)];
    }
};

int main()
{
	std::ios::sync_with_stdio(false);
	std::cin.tie(nullptr);

	int n, m; std::cin >> n >> m;
	DSU dsu(n);

	std::vector<std::vector<int>> adj(n);
	std::map<std::pair<int, int>, int> vis;
	for(int i = 0; i < m; i++)
	{
		int u, v, w; std::cin >> u >> v >> w;
		u--, v--;

		if(w == 0)
		{
			adj[u].emplace_back(v);
			adj[v].emplace_back(u);
		}
		else
		{
			vis[{u, v}] = 1;
			vis[{v, u}] = 1;
		}
	}

	std::vector<int> fa(n);
	auto init = [&](auto init, int x, int lst) -> void
	{
		fa[x] = lst;
		for(auto y : adj[x])
		{
			if(y == lst) continue;
			init(init, y, x);
		}
	};
	init(init, 0, -1);

	std::vector<int> tmp;

	auto check = [&]() -> int
	{
		int ok = 1;
		for(int i = 0; i < tmp.size(); i++)
			for(int j = i + 1; j < tmp.size(); j++)
				if(vis.contains({tmp[i], tmp[j]}) || vis.contains({tmp[j], tmp[i]}))
					dsu.merge(tmp[i], tmp[j]);

		for(int i = 1; i < tmp.size(); i++)
			if(!dsu.same(tmp[0], tmp[1])) ok = 0;

		for(auto i : tmp) dsu.f[i] = i;

		return ok;
	};	

	int ans = 0;
	auto cacl = [&](auto cacl, int x) -> void
	{
		tmp.emplace_back(x);
		ans += check();

		if(tmp.size() == 4) return;
		for(auto y : adj[x])
		{
			if(y == fa[x]) continue;
			cacl(cacl, y);
		}
		tmp.pop_back();
	};

	for(int i = 0; i < n; i++) cacl(cacl, i);

	std::cout << ans << "\n";

	return 0;
}