#include<bits/stdc++.h>
using namespace std;
typedef long long LL;
const int MAXN = 100005;

namespace ModCalculator {
    const int MOD = 998244353;
    inline void Inc(int &x, int y) {
        x += y; if (x >= MOD) x -= MOD;
    }
    inline void Dec(int &x, int y) {
        x -= y; if (x < 0) x += MOD;
    }
    inline int Mul(int x, int y) {
        return 1LL * x * y % MOD;
    }
    inline int Ksm(int x, int y) {
        int ret = 1;
        for (; y; y >>= 1) {
            if (y & 1) ret = Mul(ret, x);
            x = Mul(x, x);
        }
        return ret;
    }
    inline int Inv(int x) {
        return Ksm(x, MOD - 2);
    }
}
using namespace ModCalculator;

int n, m;
set<int> red[MAXN], blue[MAXN], both[MAXN];
vector<int> g[MAXN], gg[2][MAXN];
int vis[2][MAXN];

void Add(int u, int v) {
    if (red[u].count(v)) {
        gg[0][u].push_back(v);
        gg[0][v].push_back(u);
    }
    if (blue[u].count(v)) {
        gg[1][u].push_back(v);
        gg[1][v].push_back(u);
    }
}

void DFS(int u, int c) {
    vis[c][u] = 1;
    for (auto v : gg[c][u]) {
        if (vis[c][v]) continue;
        DFS(v, c);
    }
}

int Check(int u) {
    vector<int> a = g[u];
    a.push_back(u);
    for (int i = 0; i < 4; ++i) {
        for (int j = i + 1; j < 4; ++j) {
            Add(a[i], a[j]);
        }
    }
    for (int i = 0; i < 2; ++i) {
        for (int j = 0; j < 4; ++j) {
            vis[i][a[j]] = 0;
        }
    }
    DFS(u, 0);
    DFS(u, 1);
    for (int i = 0; i < 4; ++i) {
        gg[0][a[i]].clear();
        gg[1][a[i]].clear();
    }
    for (int i = 0; i < 2; ++i) {
        for (int j = 0; j < 4; ++j) {
            if (!vis[i][a[j]]) return 0;
        }
    }
    return 1;
}

pair<int, int> Other(int u, int v) {
    for (auto x : red[u]) {
        if (x != v) {
            return make_pair(x, 0);
        }
    }
    for (auto x : blue[u]) {
        if (x != v) {
            return make_pair(x, 1);
        }
    }
    return make_pair(0, 0);
}

void solve() {
    scanf("%d %d", &n, &m);
    for (int i = 1, u, v, c; i <= m; ++i) {
        scanf("%d %d %d", &u, &v, &c);
        g[u].push_back(v);
        g[v].push_back(u);
        if (u > v) swap(u, v);
        if (c == 0) {
            red[u].insert(v);
            red[v].insert(u);
            if (blue[u].count(v)) {
                both[u].insert(v);
            }
        } else {
            blue[u].insert(v);
            blue[v].insert(u);
            if (red[u].count(v)) {
                both[u].insert(v);
            }
        }
    }
    int ans = n;
    for (int u = 1; u <= n; ++u) {
        Inc(ans, (int)both[u].size());
        for (auto v : both[u]) {
            pair<int, int> e1 = Other(u, v), e2 = Other(v, u);
            int x = e1.first, y = e2.first;
            if (!x || !y || e1.second == e2.second) continue;
            if (x == y) {
                Inc(ans, 1);
            } else {
                if (x > y) swap(x, y);
                if (u > x) continue;
                if (both[x].count(y)) {
                    Inc(ans, 1);
                }
            }
        }
    }
    for (int u = 1; u <= n; ++u) {
        if (g[u].size() == 3 && u < g[u][0] && u < g[u][1] && u < g[u][2]) {
            Inc(ans, Check(u));
        }
    }
    printf("%d\n", ans);
}

int main() {
    solve();
    return 0;
}