/*
 /+==================================================+\
//+--------------------------------------------------+\\
|.|\\...>>>>>>> Hollwo_Pelw(ass) 's code <<<<<<<...//|.|
\\+--------------------------------------------------+//
 \+==================================================+/
*/
#include <bits/stdc++.h>
using namespace std;
// type
typedef long long ll;
typedef long double ld;
// pair
#define F                   first
#define S                   second
#define pii                 pair<int, int>
#define pll                 pair<ll, ll>
#define pdd                 pair<ld, ld>
// vector & !!?(string)
#define eb                  emplace_back
#define pb                  push_back
#define all(a)              a.begin(), a.end()
#define rall(a)             a.rbegin(), a.rend()
#define sz(a)               a.size()
#define len(a)              a.length()
// I/O
#define open(file, in, out) if (fopen(file in, "r")) {        \
                                freopen(file in, "r", stdin);  \
                                freopen(file out, "w", stdout); \
                            }
#define FAST_IO             std::ios::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
#define setpre(n)           fixed << setprecision(n)
bool endline = false;
template<class T>
istream& operator >> (istream& inp, vector<T>& v){
    for (auto& it : v) inp >> it;
    return inp;
}
template<class T>
ostream& operator << (ostream& out, vector<T>& v){
    for (auto& it : v) out << it << (endline ? "\n" : " ");
    return out;
}
template<class T, class U>
istream& operator >> (istream& inp, pair<T, U>& v){
    inp >> v.F >> v.S;
    return inp;
}
template<class T, class U>
ostream& operator << (ostream& out, pair<T, U>& v){
    out << v.F << ' ' << v.S;
    return out;
}

// geometry calculate
#define pi                  acos(-1.0)
#define g_sin(a)            sin(a*pi/180)
#define g_cos(a)            cos(a*pi/180)
#define g_tan(a)            tan(a*pi/180)
// set val
#define ms0(a)              memset(a,        0, sizeof(a));
#define ms1(a)              memset(a,        1, sizeof(a));
#define msn1(a)             memset(a,       -1, sizeof(a));
#define msinf(a)            memset(a, 0x3f3f3f, sizeof(a));
// constant
const int mod1 = 998244353, mod = 1e9 + 7;
const int MAXN = 1e5 + 6 , MAXM = 5e5 + 5;
const int inf = 2e9; const ll linf = 1e18;
// code
#define int long long

int dp[MAXN][2], n, m;
map<pii, int> col;

int val(int x, int y){
    return col.count({x, y}) ? col[{x, y}] : -1;
}

int uwu(int x, int y){
    return 1 + (int) (val(x, y) == -1 && val(y, x) == -1);
}

int binpow(int a, int x){
    int r = 1;
    while(x){
        if (x & 1) r = (r * a) % mod1;
        a = (a * a) % mod1;
        x >>= 1;
    }
    return r;
}

void Solve () {
    cin >> n >> m;

    for (int i = 0, a, b, c; i < m; i++){
        cin >> a >> b >> c;
        col[{a, b}] = c;
        if (abs(a - b) > 2){
            if (col.count({b, a}) && col[{b, a}] != c){
                cout << 0; return ;
            }
        }
    }
    dp[1][0] = val(1, 1) != 1;
    dp[1][1] = val(1, 1) != 0;
    for (int i = 2; i <= n; i++){
        for (int j = 0; j < 2; j++){
            if (val(i, i) == 1 - j) continue;
            int x = val(i - 1, i), y = val(i, i - 1);
            if(x != -1 && y != -1){
				dp[i][j] = dp[i-1][x ^ y ^ j];
			}else{
				dp[i][j] = (dp[i-1][0] + dp[i-1][1]) * uwu(i - 1, i) % mod1;
			}
        }
        if (i != n){
            int x = val(i - 1, i + 1), y = val(i + 1, i - 1);
            if (x != -1 && y != -1){
                dp[i][x ^ y ^ 1] = 0;
            }else{
                dp[i][0] = dp[i][0] * uwu(i - 1, i + 1) % mod1;
                dp[i][1] = dp[i][1] * uwu(i - 1, i + 1) % mod1;
            }
        }
//        cout << dp[i - 1][0] << ' ' << dp[i - 1][1] << endl;
    }
//    cout << dp[n][0] << ' ' << dp[n][1] << endl;
    int ans = dp[n][0] + dp[n][1], exp = (n - 2) * (n - 3) / 2;
    for (auto v : col){
        if (abs(v.F.F - v.F.S) > 2 && (!col.count({v.F.S, v.F.F}) || v.F.F <= v.F.S)) exp --;
    }
    ans = (ans * binpow(2, exp)) % mod1;
    cout << ans;
}

signed main(){
    open("", ".inp", ".out");
    FAST_IO; int TC = 1;
//    cin >> TC;
    while(TC--) Solve();
    return 0;
}
/*

./-=====>>><<<-------- DEBUG -------->>><<<=====-\.
/.................................................\
+====================== INP ======================+
2 4
1 1 1
1 2 1
2 1 1
2 2 1
+====================== OUT ======================+
0 ??



+======================*****======================+
\................................................./
.\-=====>>><<<--------= END =-------->>><<<=====-/.

*/


Measured memory_bytes: 8360