#include <bits/stdc++.h>
using namespace std;
using lint = long long int;
using pint = pair<int, int>;
using plint = pair<lint, lint>;
struct fast_ios { fast_ios(){ cin.tie(0); ios::sync_with_stdio(false); cout << fixed << setprecision(20); }; } fast_ios_;
#define FOR(i, begin, end) for(int i=(begin),i##_end_=(end);i<i##_end_;i++)
#define IFOR(i, begin, end) for(int i=(end)-1,i##_begin_=(begin);i>=i##_begin_;i--)
#define REP(i, n) FOR(i,0,n)
#define IREP(i, n) IFOR(i,0,n)
template<typename T> istream& operator>>(istream &is, vector<T> &vec){ for (auto &v : vec) is >> v; return is; }
template<typename T> ostream& operator<<(ostream &os, const vector<T> &vec){ os << "["; for (auto v : vec) os << v << ","; os << "]"; return os; }
template<typename T> ostream& operator<<(ostream &os, const set<T> &vec){ os << "{"; for (auto v : vec) os << v << ","; os << "}"; return os; }
template<typename T> ostream& operator<<(ostream &os, const unordered_set<T> &vec){ os << "{"; for (auto v : vec) os << v << ","; os << "}"; return os; }
template<typename T> ostream& operator<<(ostream &os, const multiset<T> &vec){ os << "{"; for (auto v : vec) os << v << ","; os << "}"; return os; }
template<typename T> ostream& operator<<(ostream &os, const unordered_multiset<T> &vec){ os << "{"; for (auto v : vec) os << v << ","; os << "}"; return os; }
template<typename T1, typename T2> ostream& operator<<(ostream &os, const pair<T1, T2> &pa){ os << "(" << pa.first << "," << pa.second << ")"; return os; }
template<typename TK, typename TV> ostream& operator<<(ostream &os, const map<TK, TV> &mp){ os << "{"; for (auto v : mp) os << v.first << "=>" << v.second << ","; os << "}"; return os; }
template<typename TK, typename TV> ostream& operator<<(ostream &os, const unordered_map<TK, TV> &mp){ os << "{"; for (auto v : mp) os << v.first << "=>" << v.second << ","; os << "}"; return os; }
template<typename T> void ndarray(vector<T> &vec, int len) { vec.resize(len); }
template<typename T, typename... Args> void ndarray(vector<T> &vec, int len, Args... args) { vec.resize(len); for (auto &v : vec) ndarray(v, args...); }
template<typename T> void Max(T &m, const T q) { if (m < q) m = q; }
template<typename T> void Min(T &m, const T q) { if (m > q) m = q; }
template<typename T1, typename T2> pair<T1, T2> operator+(pair<T1, T2> &l, pair<T1, T2> &r) { return make_pair(l.first + r.first, l.second + r.second); }
template<typename T1, typename T2> pair<T1, T2> operator-(pair<T1, T2> &l, pair<T1, T2> &r) { return make_pair(l.first - r.first, l.second - r.second); }
#define dbg(x) cerr << #x << " = " << (x) << " (L" << __LINE__ << ") " << __FILE__ << endl;

int N, M;

map<pint, int> shown;

constexpr lint MOD = 998244353;
lint power(lint x, lint n, lint MOD = MOD)
{
    lint ans = 1;
    while (n>0)
    {
        if (n & 1) (ans *= x) %= MOD;
        (x *= x) %= MOD;
       n >>= 1;
    }
   return ans;
}

int main()
{
    cin >> N >> M;
    int a, b, c;
    vector<int> j_dec(N);
    REP(i, M)
    {
        cin >> a >> b >> c;
        if (!shown.count(pint(b, a))) j_dec[abs(a - b)]++;
        shown[pint(a, b)] = c;

        if (abs(a - b) > 2)
        {
            if (shown.count(pint(b, a)) && shown[pint(b, a)] != c)
            {
                cout << 0 << endl;
                return 0;
            }
        }
    }

    lint ans = 0;
    vector<lint> dp{1, 1};
    if (shown.count(pint(1, 1))) dp[!shown[pint(1, 1)]] = 0;

    FOR(i, 1, N)
    {

        if (i > 1)
        {
            int n = shown.count(pint(i + 1, i - 1)) + shown.count(pint(i - 1, i + 1));
            if (n == 2)
            {
                dp[!((shown[pint(i + 1, i - 1)] + shown[pint(i - 1, i + 1)]) & 1)] = 0;
            }
            if (n == 0)
            {
                dp[0] = dp[0] * 2 % MOD;
                dp[1] = dp[1] * 2 % MOD;
            }
        }
        vector<int> vec;
        if (shown.count(pint(i, i + 1))) vec.push_back(shown[pint(i, i + 1)]); else vec.push_back(-1);
        if (shown.count(pint(i + 1, i))) vec.push_back(shown[pint(i + 1, i)]); else vec.push_back(-1);
        for (auto v : vec)
        {
            if (v == 1) swap(dp[0], dp[1]);
            if (v == -1)
            {
                lint nx = (dp[0] + dp[1]) % MOD;
                dp[0] = dp[1] = nx;
            }
        }

        if (shown.count(pint(i + 1, i + 1)))
        {
            lint tmp = shown[pint(i + 1, i + 1)];
            dp[!tmp] = 0;
        }
    }

    ans = (dp[0] + dp[1]) % MOD;
    FOR(i, 3, N)
    {
        ans *= power(2, N - i - j_dec[i]);
        ans %= MOD;
    }
    dbg(ans);
    cout << ans << endl;
}


Measured memory_bytes: 3840