#include <bits/stdc++.h>
using namespace std;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }

#define COUT(x) cout << #x << " = " << (x) << " (L" << __LINE__ << ")" << endl
template<class T1, class T2> ostream& operator << (ostream &s, pair<T1,T2> P)
{ return s << '<' << P.first << ", " << P.second << '>'; }
template<class T> ostream& operator << (ostream &s, vector<T> P)
{ for (int i = 0; i < P.size(); ++i) { if (i > 0) { s << " "; } s << P[i]; } return s; }
template<class T> ostream& operator << (ostream &s, vector<vector<T> > P)
{ for (int i = 0; i < P.size(); ++i) { s << endl << P[i]; } return s << endl; }
template<class T> ostream& operator << (ostream &s, set<T> P)
{ for(auto it : P) { s << "<" << it << "> "; } return s << endl; }
template<class T1, class T2> ostream& operator << (ostream &s, map<T1,T2> P)
{ for(auto it : P) { s << "<" << it.first << "->" << it.second << "> "; } return s << endl; }


template<int MOD> struct Fp {
    long long val;
    constexpr Fp(long long v = 0) noexcept : val(v % MOD) {
        if (val < 0) val += MOD;
    }
    constexpr int getmod() { return MOD; }
    constexpr Fp operator - () const noexcept {
        return val ? MOD - val : 0;
    }
    constexpr Fp operator + (const Fp& r) const noexcept { return Fp(*this) += r; }
    constexpr Fp operator - (const Fp& r) const noexcept { return Fp(*this) -= r; }
    constexpr Fp operator * (const Fp& r) const noexcept { return Fp(*this) *= r; }
    constexpr Fp operator / (const Fp& r) const noexcept { return Fp(*this) /= r; }
    constexpr Fp& operator += (const Fp& r) noexcept {
        val += r.val;
        if (val >= MOD) val -= MOD;
        return *this;
    }
    constexpr Fp& operator -= (const Fp& r) noexcept {
        val -= r.val;
        if (val < 0) val += MOD;
        return *this;
    }
    constexpr Fp& operator *= (const Fp& r) noexcept {
        val = val * r.val % MOD;
        return *this;
    }
    constexpr Fp& operator /= (const Fp& r) noexcept {
        long long a = r.val, b = MOD, u = 1, v = 0;
        while (b) {
            long long t = a / b;
            a -= t * b; swap(a, b);
            u -= t * v; swap(u, v);
        }
        val = val * u % MOD;
        if (val < 0) val += MOD;
        return *this;
    }
    constexpr bool operator == (const Fp& r) const noexcept {
        return this->val == r.val;
    }
    constexpr bool operator != (const Fp& r) const noexcept {
        return this->val != r.val;
    }
    friend constexpr ostream& operator << (ostream &os, const Fp<MOD>& x) noexcept {
        return os << x.val;
    }
    friend constexpr Fp<MOD> modpow(const Fp<MOD> &a, long long n) noexcept {
        if (n == 0) return 1;
        auto t = modpow(a, n / 2);
        t = t * t;
        if (n & 1) t = t * a;
        return t;
    }
};
const int MOD = 998244353;
using mint = Fp<MOD>;
using pint = pair<int,int>;

long long N, M;
map<pint,int> fi;

mint solve() {
    long long honsuu = N*(N-1)/2 + M;

    // 差 3 以上の対角制約がすでに満たしているか
    set<pint> alr;
    for (auto it : fi) {
        pint p = it.first;
        if (alr.count(p)) continue;
        if (abs(p.first - p.second) >= 3) {
            int v = it.second;
            pint rp = {p.second, p.first};
            if (fi.count(rp)) {
                if (fi[rp] != v) return 0;
                else --honsuu;
            }
            alr.insert(p); alr.insert(rp);
        }
    }
    
    // 斜め 3 制約をあらかじめ埋める
    for (int i = 1; i < N-1; ++i) {
        int sum = 0;
        if (fi.count(pint(i-1,i+1)) && fi.count(pint(i+1,i-1))) {
            int v = fi[pint(i-1,i+1)] ^ fi[pint(i+1,i-1)];
            if (fi.count(pint(i,i))) {
                if (fi[pint(i,i)] != v) return 0;
                else --honsuu;
            }
            else fi[pint(i,i)] = v;
        }
    }

    // 2 × 2 制約
    for (int i = 0; i < N-1; ++i) {
        int sum = 0;
        bool all = true;
        if (fi.count(pint(i,i+1)) && fi.count(pint(i+1,i))) {
            int v = fi[pint(i,i+1)] ^ fi[pint(i+1,i)];
            if (fi.count(pint(i,i)) && fi.count(pint(i+1,i+1))) {
                if ((fi[pint(i,i)] ^ fi[pint(i+1,i+1)]) != v) return 0;
                else --honsuu;
            }
            else if (fi.count(pint(i,i))) fi[pint(i+1,i+1)] = v ^ fi[pint(i,i)];
            else if (fi.count(pint(i+1,i+1))) fi[pint(i,i)] = v ^ fi[pint(i+1,i+1)];
        }
    }

    //COUT(honsuu);
    
    return modpow(mint(2), N*N - honsuu);
}

int main() {
    cin >> N >> M;
    fi.clear();
    for (int i = 0; i < M; ++i) {
        int a, b, c; cin >> a >> b >> c; --a, --b;
        fi[pint(a, b)] = c;
    }
    cout << solve() << endl;
}


















Measured memory_bytes: 8064