#include <bits/stdc++.h>
using namespace std;
#define PII pair<long long ,long long>
#define int long long
const int N = 2e6 + 10,MOD=1004535809,B=13331,inf=1e18,mod=998244353;
int dx[]={1,-1,0,0};
int dy[]={0,0,-1,1};


struct DSU {
    std::vector<int> f;
    std::vector<int> size;

    DSU(int n) : f(n), size(n) {
        std::iota(f.begin(), f.end(), 0);
        std::fill(size.begin(), size.end(), 1);
    }

    int find(int x) {
        while (x != f[x])
            x = f[x] = f[f[x]];
        return x;
    }

    void Union(int x, int y) {
        if (find(x) == find(y))
            return;

        size[find(x)] += size[find(y)];
        f[find(y)] = find(x);
    }

    int blockSize(int x) {
        return size[find(x)];
    }
};

inline int read()
{
    int x=0,f=1;
    char ch=getchar();
    while(ch<'0'||ch>'9')
    {
        if(ch=='-') f=-1;
        ch=getchar();
    }
    while(ch>='0' && ch<='9')  x=x*10+ch-'0',ch=getchar();
    return x*f;
}
inline void write( int x ) {
    if ( x < 0 ) putchar ('-'), x = -x;
    if ( x > 9 ) write ( x / 10 ); putchar ( x % 10 | 48 );
}
int n,m,ans;
vector<int>e1[N],e2[N];
set<int>s1,s2;
map<PII,int>mp1,mp2;

void dfs1(int u,int fa)
{
    s1.insert(u);
    for(auto v:e1[u])
    {
        if(v==fa) continue;
        dfs1(v,u);
    }
}
void dfs2(int u,int fa)
{
    s2.insert(u);
    for(auto v:e2[u])
    {
        if(v==fa) continue;
        dfs2(v,u);
    }
}
void lei()
{
    n=read(),m=read();
    DSU dsu1(n+1),dsu2(n+1);
    ans=n;
    for(int i=1;i<=m;i++)
    {
        int u=read(),v=read(),w=read();
        if(u<v) swap(u,v);
        if(w==0)
        {
            e1[u].push_back(v);
            e1[v].push_back(u);
            dsu1.Union(u,v);
            mp1[{u,v}]++;
        }
        else
        {
            e2[u].push_back(v);
            e2[v].push_back(u);
            dsu2.Union(u,v);
            mp2[{u,v}]++;
        }
    }
    for(int i=1;i<=n;i++)
    {
        if(dsu1.find(i)==i&&dsu1.blockSize(i)==4)
        {
            s1.clear();
            dfs1(i,0);
            s2.clear();
            dfs2(i,0);
            if(s1==s2) ans++;
        }
    }
    for(auto [t,i]:mp1)
    {
        if(mp2[t])
        {
            ans++;
            auto [u1,u2]=t;

            for(auto v1:e1[u1])
            {
                if(v1==u2) continue;
                if(mp2[{max(u2,v1), min(u2,v1)}]) ans++;
            }
            for(auto v2:e1[u2])
            {
                if(v2==u1) continue;
                if(mp2[{max(u1,v2), min(u1,v2)}]) ans++;
            }
        }
    }
}
signed main()
{
//    std::ios::sync_with_stdio(false);
//    std::cin.tie(0);
//    std::cout.tie(0);


    int Tao=1;
    //Tao=read();
    while(Tao--)     lei();
    cout<<ans%mod;
    //if(mp1[{23,45}]) cout<<1;
    return 0;
}