#include <bits/stdc++.h>
using namespace std;
#define int long long
using ull=unsigned long long;
using ll=long long;
unordered_map<int,int> mp[100010];
const ll mod=998244353;
int ct[100010];
int le[100010],re[100010];
vector<pair<int,int>> ve[100010];
bool flag[100010];
int sz=0,zo=0,on=0;
void dfs(int u){
    sz++;
    flag[u]=1;
    for(auto i:ve[u]){
        if(i.second==0) zo++;
        else on++;
        if(flag[i.first])   continue;
        //flag[i.first]=1;
        dfs(i.first);
    }
}
void solve() {
    int n,m;
    cin>>n>>m;
    ll ans=n;
    for(int i=1,u,v,w;i<=m;i++){
        cin>>u>>v>>w;
        ve[u].push_back({v,w});
        ve[v].push_back({u,w});
        if(!mp[u][v])   mp[u][v]=w+1;
        else{
            mp[u][v]=3;
            ans=(ans+1)%mod;
        }
        swap(u,v);
        if(!mp[u][v])   mp[u][v]=w+1;
        else{
            mp[u][v]=3;
            //ans++;
        }
    }
    ll mzq=0;
    for(int i=1;i<=n;i++){
        for(auto j:mp[i]){
            if(j.second==3){
                if(mp[i].size()==2&&mp[j.first].size()==2){
                    int lz=0,rz=0;
                    int lj=0,lq=0;
                    for(auto mz:mp[i]){
                        if(mz.first!=j.first)  lj=mz.first;
                        lz+=mz.second;
                    }
                    for(auto mz:mp[j.first]){
                        if(mz.first!=i)  lq=mz.first;
                        rz+=mz.second;     
                    } 
                    if(lz+rz==9&&lj==lq){
                        mzq++;
                        //cout<<i<<' '<<j.first<<'\n';
                    }          
                }
            }
        }
    }
    ans=(ans+mzq/2)%mod;
    for(int i=1;i<=n;i++){
        sz=zo=on=0;
        if(!flag[i])    dfs(i);
        //cout<<sz<<' '<<zo<<' '<<on<<'\n';
        if(sz==4&&zo==6&&on==6) ans=(ans+1)%mod;
    }
    cout<<ans%mod<<'\n';
}
signed main() {
    ios::sync_with_stdio(0),cin.tie(0);
    int _ = 1;
    //cin >> _;
    while(_--) solve();
    return 0;
}