#pragma GCC target("avx2,avx")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
//#include <atcoder/all>
//using namespace atcoder;
//using mint = modint998244353;
//using mint = modint1000000007;
#include <bits/stdc++.h>
using namespace std;
//#include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/tree_policy.hpp>
//using namespace __gnu_pbds;
//using i128 = __int128_t;
using ll = long long;
using ull = unsigned long long;
using pii = pair<int, int>;
using pll = pair<long long, long long>;
#define rep(i, n) for(int i = 0; i < (n); ++i)
#define all(x) (x).begin(),(x).end()
#define SZ(x) ((int)(x).size())
constexpr char ln = '\n';
template<class T1, class T2> inline bool chmax(T1 &a, T2 b) {if (a < b) {a = b; return true;} return false;}
template<class T1, class T2> inline bool chmin(T1 &a, T2 b) {if (a > b) {a = b; return true;} return false;}
inline int topbit(int x) {return x == 0 ? -1 : 31-__builtin_clz(x);}
inline int topbit(long long x) {return x == 0 ? -1 : 63-__builtin_clzll(x);}
inline int botbit(int x) {return x == 0 ? 32 : __builtin_ctz(x);}
inline int botbit(long long x) {return x == 0 ? 64 : __builtin_ctzll(x);}
inline int popcount(int x) {return __builtin_popcount(x);}
inline int popcount(long long x) {return __builtin_popcountll(x);}
inline int kthbit(long long x, int k) {return (x>>k)&1;}
inline void print() {cout << "\n";}
template<class T>
inline void print(const vector<T> &v) {
    for (auto itr = v.begin(); itr != v.end(); ++itr) cout << *itr << " ";
    print();
}
template<class T, class... Args>
inline void print(const T &x, const Args &... args) {
    cout << x << " ";
    print(args...);
}
#ifdef MINATO_LOCAL
#define dump(x) cerr << __LINE__ << " : " << #x << " = " << (x) << endl;
inline void debug() {cerr << endl;}
template<class T>
inline void debug(const vector<T> &v) {
    for (auto itr = v.begin(); itr != v.end(); ++itr) cerr << *itr << " ";
    debug();
}
template<class T, class... Args>
inline void debug(const T &x, const Args &... args) {
    cerr << x << " ";
    debug(args...);
}
#else
#define dump(x) void(0)
inline void debug() {}
template<class T> inline void debug(const vector<T> &v) {}
template<class T, class... Args> inline void debug(const T &x, const Args &... args) {}
#endif
struct Fast_ios {Fast_ios() {cin.tie(nullptr); ios::sync_with_stdio(false); cout << fixed << setprecision(20);};} fast_ios;
////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////

template <uint_fast64_t Modulus> 
struct ModInt {
    using u64 = uint_fast64_t;

    u64 a;

    constexpr ModInt(const long long x = 0) noexcept : a(x >= 0 ? x % Modulus : (Modulus - (-x) % Modulus) % Modulus) {}
    constexpr u64 &value() noexcept {return a;}
    constexpr const u64 &value() const noexcept {return a;}
    constexpr ModInt operator+(const ModInt rhs) const noexcept {return ModInt(*this) += rhs;}
    constexpr ModInt operator-(const ModInt rhs) const noexcept {return ModInt(*this) -= rhs;}
    constexpr ModInt operator*(const ModInt rhs) const noexcept {return ModInt(*this) *= rhs;}
    constexpr ModInt operator/(const ModInt rhs) const noexcept {return ModInt(*this) /= rhs;}
    constexpr ModInt operator^(const long long rhs) const noexcept {return ModInt(*this) ^= rhs;}
    constexpr bool operator==(const ModInt &rhs) const noexcept {return a == rhs.a;}
    constexpr bool operator!=(const ModInt &rhs) const noexcept {return a != rhs.a;}
    constexpr ModInt &operator+=(const ModInt rhs) noexcept {
        a += rhs.a;
        if (a >= Modulus) {
            a -= Modulus;
        }
        return *this;
    }
    constexpr ModInt &operator-=(const ModInt rhs) noexcept {
        if (a < rhs.a) {
            a += Modulus;
        }
        a -= rhs.a;
        return *this;
    }
    constexpr ModInt &operator*=(const ModInt rhs) noexcept {
        a = a * rhs.a % Modulus;
        return *this;
    }
    constexpr ModInt &operator/=(ModInt rhs) noexcept {
        u64 exp = Modulus - 2;
        while (exp) {
            if (exp&1) *this *= rhs;
            exp >>= 1;
            rhs *= rhs;
        }
        return *this;
    }
    constexpr ModInt &operator^=(long long exp) noexcept {
        ModInt rhs = a;
        a = 1;
        while (exp) {
            if (exp&1) *this *= rhs;
            exp >>= 1;
            rhs *= rhs;
        }
        return *this;
    }

    friend ostream &operator<<(ostream& os, const ModInt& rhs) noexcept {return os << rhs.a;}
    friend istream &operator>>(istream& is, ModInt& rhs) noexcept {long long a; is >> a; rhs = a; return is;}
};

//constexpr long long MOD = 1000000007;
constexpr long long MOD = 998244353;

using mint = ModInt<MOD>;


int main() {
    ll N,M; cin >> N >> M;
    ll exp = (N-2)*(N-3)/2+N;
    vector<int> center(N,-1);
    vector<int> E(N-1,-1);
    map<pii, int> dic;
    rep(i,M) {
        int a,b,c; cin >> a >> b >> c;
        --a; --b;
        if (abs(a-b)>=3) {
            if (dic.count(pii(a,b))) {
                if (dic[pii(a,b)]!=c) {
                    cout << 0 << ln;
                    return 0;
                }
            } else {
                dic[pii(a,b)] = dic[pii(b,a)] = c;
                exp--;
            }
        } else if (a==b) {
            center[a] = c;
        } else {
            dic[pii(a,b)] = c;
        }
    }

    for (int i = 1; i < N-1; i++) {
        if (dic.count(pii(i-1,i+1)) and dic.count(pii(i+1,i-1))) {
            if (center[i]==-1) {
                center[i] = dic[pii(i-1,i+1)]^dic[pii(i+1,i-1)];
            } else {
                if (center[i] != (dic[pii(i-1,i+1)]^dic[pii(i+1,i-1)])) {
                    cout << 0 << ln;
                    return 0;
                }
            }
        } else if (!dic.count(pii(i-1,i+1)) and !dic.count(pii(i+1,i-1))) {
            exp++;
        }
    }

    rep(i,N-1) {
        if (dic.count(pii(i,i+1)) and dic.count(pii(i+1,i))) {
            E[i] = dic[pii(i,i+1)]^dic[pii(i+1,i)];
            exp--;
        } else if (!dic.count(pii(i,i+1)) and !dic.count(pii(i+1,i))) {
            exp++;
        }
    }

    {
        vector<bool> seen(N);
        rep(i,N) {
            if (center[i]==-1) continue;
            if (seen[i]) continue;
            seen[i] = 1;
            for (int j = i-1; j >= 0; j--) {
                if (E[j]==-1) break;
                if (seen[j]) break;
                seen[j] = 1;
                if (~center[j] and center[j]!=(center[j+1]^E[j])) {
                    cout << 0 << ln;
                    return 0;
                }
                center[j] = center[j+1]^E[j];
            }
            for (int j = i+1; j < N; j++) {
                if (E[j-1]==-1) break;
                if (seen[j]) break;
                seen[j] = 1;
                if (~center[j] and center[j]!=(center[j-1]^E[j-1])) {
                    cout << 0 << ln;
                    return 0;
                }
                center[j] = center[j-1]^E[j-1];
            }
            exp--;
        }
    }

    mint ans = 2;
    ans ^= exp;
    cout << ans << ln;
}


Measured memory_bytes: 10268