#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::vector<std::set<int>> adj2(n);
	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
		{
			if(u > v) std::swap(u, v);
			adj2[u].emplace(v);
		}
	}

	std::vector<int> tmp;

	auto check = [&]() -> int
	{
		int ok = 1;
		std::ranges::sort(tmp);
		for(int i = 0; i < tmp.size(); i++)
			for(int j = i + 1; j < tmp.size(); j++)
				if(adj2[tmp[i]].contains(tmp[j]))
					dsu.merge(tmp[i], tmp[j]);

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

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

		// std::cerr << ok << " : ";
		// for(auto i : tmp) std::cerr << i + 1 << " ";
		// std::cerr << "\n";

		return ok;
	};	

	int ans = 0;
	std::vector<int> vis(n);
	auto cacl = [&](auto cacl, int x) -> void
	{
		ans += check();

		if(tmp.size() >= 4) return;
		for(auto y : adj[x])
		{
			if(vis[y]) continue;

			vis[y] = 1;
			tmp.emplace_back(y);
			cacl(cacl, y);

			if(tmp.size() == 4) tmp.pop_back(), vis[y] = 0;
		} 
	};

	for(int i = 0; i < n; i++) 
	{
		for(auto j : tmp) if(j >= i) vis[j] = 0;
		tmp.clear();
		tmp.emplace_back(i);
		vis[i] = 1;
		cacl(cacl, i);
	}

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

	return 0;
}