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

typedef long long ll;

const int N = 1e5 + 10, mod = 998244353;

vector<pair<int, int>> adj[N];

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

    int n, m;
    cin >> n >> m;
    for(int i = 0; i < m; i ++ ) {
        int u, v, c;
        cin >> u >> v >> c;
        adj[u].push_back({v, c});
        adj[v].push_back({u, c});
    }

    vector<ll> f(5, 0);
    for(int u = 1; u <= n; u ++ ) {
        set<pair<int, int>> s;
        for(auto [v, c] : adj[u]) {
            s.insert({v, c});
        }
        for(auto [v, c] : s) {
            if(!s.count({v, !c})) {
                f[1] ++ ;
            }
        }
    }
    f[0] = n, f[1] = 1ll * n * (n - 1) / 2 - f[1] / 2;
    
    for(int u = 1; u <= n; u ++ ) {
        multiset<pair<int, int>> s;
        for(auto [v, c] : adj[u]) {
            s.insert({v, c});
        }
        vector<int> arr;
        for(auto [v, c] : adj[u]) {
            if(s.count({v, !c})) {
                arr.push_back(v);
            }
        }
        for(auto v : arr) {
            for(auto [q, c] : adj[v]) {
                if(s.count({q, !c})) {
                    f[2] ++ ;
                }
            }
        }
    }
    f[2] = f[2] / 4;

    for(int u = 1; u <= n; u ++ ) {
        for(auto [v, c] : adj[u]) {
            multiset<pair<int, int>> su, sv;
            for(auto [q, cc] : adj[u]) {
                su.insert({q, cc});
            }
            for(auto [q, cc] : adj[v]) {
                sv.insert({q, cc});
            }

            for(auto [p, _] : adj[u]) {
                for(auto [q, __] : adj[v]) {
                    if(p != v && p != q && q != u) {
                        for(auto [tmpv, tmpc] : adj[p]) {
                            if(tmpv == q && tmpc == 1 && c == 0) {
                                if(su.count({p, 0}) && su.count({p, 1}) && sv.count({q, 0}) && sv.count({q, 1})) {
                                    f[3] ++ ;
                                }
                                if(su.count({p, 1}) && su.count({q, 0}) && sv.count({p, 0}) && sv.count({q, 1})) {
                                    f[4] ++ ;
                                }
                            } else if(tmpv == q && tmpc == 0 && c == 1) {
                                if(su.count({p, 0}) && su.count({p, 1}) && sv.count({q, 0}) && sv.count({q, 1})) {
                                    f[3] ++ ;
                                }
                                if(su.count({p, 0}) && su.count({q, 1}) && sv.count({p, 1}) && sv.count({q, 0})) {
                                    f[4] ++ ;
                                }
                            }
                        }
                    }
                }
            }
        }
    }
    f[3] = f[3] / 4, f[4] = f[4] / 4;

    ll ans = 0;
    for(int i = 0; i < 5; i ++ ) {
        // cout << f[i] << ' ';
        ans = (ans + f[i] % mod) % mod;
    }
    // cout << '\n';
    cout << ans << '\n';

    return 0;
}