#include <bits/stdc++.h>
#pragma comment(linker, "/STACK:268435456")
using namespace std;
template <typename T>
inline T abs(T a) {
  return ((a < 0) ? -a : a);
}
template <typename T>
inline T sqr(T a) {
  return a * a;
}
template <class T>
T gcd(T a, T b) {
  return a ? gcd(b % a, a) : b;
}
template <class T>
T lcm(T a, T b) {
  return a / gcd(a, b) * b;
}
template <class T>
T sign(T a) {
  return a > 0 ? 1 : (a < 0 ? -1 : 0);
}
const int dx[] = {-1, 0, 1, 0};
const int dy[] = {0, 1, 0, -1};
const int dxK[] = {-1, -1, 0, 1, 1, 1, 0, -1};
const int dyK[] = {0, 1, 1, 1, 0, -1, -1, -1};
const int dxKn[] = {-2, -1, 1, 2, 2, 1, -1, -2};
const int dyKn[] = {1, 2, 2, 1, -1, -2, -2, -1};
const int N = int(1e5) + 9;
const int M = int(3e3) + 9;
const int LOGN = 22;
const int SQN = 350;
const int MOD = int(1e9) + 7;
const int INF = 1e9 + 100;
const long long INF64 = 2e18;
const long double PI = 3.1415926535897932384626433832795;
const long double EPS = 1e-9;
int n, m;
vector<pair<int, int> > g1[N];
set<int> g2[N];
int col[N], cntc;
int col2[N];
void dfs1(int v) {
  col[v] = cntc;
  for (int i = 0; i < (int)((int)(g1[v].size())); ++i) {
    int to = g1[v][i].first, c = g1[v][i].second;
    if (c == 1) {
      if (col[to] == 0) dfs1(to);
      assert(col[to] == col[v]);
    } else {
      if (col[to] != 0) {
        if (col[to] == col[v]) {
          cout << 0;
          exit(0);
        }
        g2[col[v]].insert(col[to]), g2[col[to]].insert(col[v]);
      }
    }
  }
}
void dfs2(int v, int p = -1, int cc = 1) {
  col[v] = 1;
  col2[v] = cc;
  for (set<int>::iterator it = g2[v].begin(); it != g2[v].end(); ++it) {
    int to = *it;
    if (to == p) continue;
    if (col[to]) {
      if (col[to] == 1 && col2[to] == col2[v]) {
        cout << 0;
        exit(0);
      }
    } else if (col[to] == 0)
      dfs2(to, v, 3 - cc);
  }
  col[v] = 2;
}
void solve() {
  cin >> n >> m;
  for (int i = 0; i < (int)(m); ++i) {
    int a, b, c;
    cin >> a >> b >> c;
    --a, --b;
    g1[a].push_back(make_pair(b, c));
    g1[b].push_back(make_pair(a, c));
  }
  for (int i = 0; i < (int)(n); ++i)
    if (col[i] == 0) {
      ++cntc;
      dfs1(i);
    }
  n = 0;
  memset(col, 0, sizeof col);
  for (int i = 1; i <= cntc; ++i)
    if (col[i] == 0) dfs2(i), ++n;
  int res = 1;
  for (int i = 1; i < (int)(n); ++i) res = (res * 1LL * 2) % MOD;
  cout << res;
}
int main() {
  srand(time(NULL));
  cout << setprecision(10) << fixed;
  cerr << setprecision(10) << fixed;
  ios_base::sync_with_stdio(0);
  solve();
  return 0;
}
