#include <bits/stdc++.h>

using namespace std;

#define MASK(x) (1LL << (x))
#define BIT(x, i) (((x) >> (i)) & 1)
#define ALL(x) (x).begin(), (x).end()

#define REP(i, n) for (int i = 0, _n = n; i < _n; ++i)
#define FOR(i, a, b) for (int i = (a), _b = (b); i <= _b; ++i)
#define FORD(i, a, b) for (int i = (a), _b = (b); i >= _b; --i)
#define FORE(it, s) for (__typeof(s.begin()) it = (s).begin(); it != (s).end(); ++it)

#define TIME (1.0 * clock() / CLOCKS_PER_SEC)
#define file(TASK)                         \
    if (fopen(TASK ".inp", "r")) {         \
        freopen(TASK ".inp", "r", stdin);  \
        freopen(TASK ".out", "w", stdout); \
    }

template <class U, class V> bool maximize(U &A, const V &B) { return (A < B) ? (A = B, true) : false; }
template <class U, class V> bool minimize(U &A, const V &B) { return (A > B) ? (A = B, true) : false; }
const int Mod = 1e9 + 7;
const int MAXN = 1e5 + 5;
struct QUERY {
    int l, r, value;
}queries[MAXN];
int N, Q, color[MAXN];
vector <int> same_color[MAXN], diff_color[MAXN];
int ans = 1;
void dfs(int u, int tmpColor) {
    if(color[u] != -1 && color[u] != tmpColor) {
        cout << 0;
        exit(0);
    }
    if(color[u] != -1) return;
    color[u] = tmpColor;
    for (auto v : same_color[u]) dfs(v, tmpColor);
    for (auto v : diff_color[u]) dfs(v, 1 ^ tmpColor);
}
int calc(int biti) {
    fill(same_color, same_color + N + 1, vector <int> ());
    fill(diff_color, diff_color + N + 1, vector <int> ());
    fill(color, color + N + 1, -1);
    FOR(i, 1, Q) {
        if(BIT(queries[i].value, biti)) {
            diff_color[queries[i].l - 1].push_back(queries[i].r);
            diff_color[queries[i].r].push_back(queries[i].l - 1);
        } else {
            same_color[queries[i].l - 1].push_back(queries[i].r);
            same_color[queries[i].r].push_back(queries[i].l - 1);
        }
    }
    int ans = 1;
    REP(u, N + 1) if(color[u] == -1) {
        dfs(u, 0);
        if(u > 0) ans += ans;
        if(ans >= Mod) ans -= Mod;
    }
    return ans;
}
void process(void) {
    cin >> N >> Q;
    FOR(i, 1, Q) cin >> queries[i].l >> queries[i].r >> queries[i].value;
    REP(biti, 30) ans = 1LL * ans * calc(biti) % Mod;
    cout << ans;
}
signed main() {
    file("TASK");
    ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
    int test = 1;
    // cin >> test;
    while(test--) {
        process();
        cout << '\n';
    }
    cerr << "Time elapsed: " << TIME << " s.\n";
    return (0 ^ 0);
}