#include<bits/stdc++.h>
using namespace std;
#define For(i,a,b) for(int i = a; i <= b; ++i)
#define int long long 
const int mod = 998244353;
const int N = 1e5 + 100;
int inter(vector<int> &a, vector<int> &b){
    int cnt = 0;
    for(auto &x : a)
        for(auto &y : b)
            if(x == y){
                ++cnt;
                break;
            }
    return cnt;
}
vector<int> Red[N],Blue[N];

int check(vector<int> &candi){
    // assert(0);
    vector<int> r,b;
    for(auto &node : candi){
        for(auto &arr : Red[node])
            r.emplace_back(arr);
        for(auto &arr : Blue[node])
            b.emplace_back(arr);
    }
    sort(candi.begin(),candi.end());
    sort(r.begin(),r.end()); r.resize(unique(r.begin(),r.end()) - r.begin());
    sort(b.begin(),b.end()); b.resize(unique(b.begin(),b.end()) - b.begin());

    if(min(r.size(),min(b.size(),candi.size())) < 4)
        return 0;
    for(int i = 0;i < 4; ++i){
        if(b[i] != r[i] || candi[i] != r[i] || b[i] != candi[i])
            return 0;
    }
    // assert(0);
    return 1;
    
}
map<pair<int,int>,int> M[2];
signed main(){
    #ifdef NICEGUODONG
        freopen("data.in","r",stdin);
    #endif
    ios::sync_with_stdio(false);
    int n,m;
    cin >> n >> m;
    For(i,1,m){
        int u,v,w;
        cin >> u >> v >> w;
        if(u > v) swap(u,v);
        if(w == 0)
            Red[u].emplace_back(v),Red[v].emplace_back(u);
        else
            Blue[u].emplace_back(v),Blue[v].emplace_back(u);
        M[w][make_pair(u,v)] = 1;
    }
    int ans = n;
    for(auto [uv,_] : M[0]){
        if(M[1].find(uv) != M[1].end()){
            ++ans;
            auto [u,v] = uv;
            ans += inter(Red[u],Blue[v]);
            ans += inter(Blue[u],Red[v]);
            ans %= mod;
        }
    }
    vector<int> Vis(n + 1);
    for(int i = 1; i <= n; ++i){
        if(Vis[i]) 
            continue;
        queue<int> Q;
        vector<int> candi;
        Q.push(i);
        while(!Q.empty()){
            int f = Q.front();
            Q.pop();
            Vis[f] = 1;
            candi.emplace_back(f);
            // if(candi.size() > 4) break;
            for(auto &x : Red[f])
                if(!Vis[x]){
                    Q.push(x);
                    Vis[x] = 1;
                }
            for(auto &x : Blue[f])
                if(!Vis[x]){
                    Q.push(x);
                    Vis[x] = 1;
                }
        }
        if(candi.size() == 4){
            ans += check(candi);
        }
    }
    cout << ans % mod << '\n';
}