#include<iostream>
#include<cstring>
#include<vector>
#include<array>
using namespace std;
using LL = long long;
const int mod = 1e9 + 7;

void add(int &a, int b){
    a += b;
    if (a >= mod) a -= mod;
}

int mul(int a, int b){
    return 1LL * a * b % mod;
}

int main(){

#ifdef LOCAL
    freopen("data.in", "r", stdin);
    freopen("data.out", "w", stdout);
#endif

    cin.tie(0);
    cout.tie(0);
    ios::sync_with_stdio(0);

    int n, m;
    cin >> n >> m;
    vector<array<int, 6> > p(m);
    vector<vector<pair<int, int> > > g(n + 1);
    for(int i = 0; i < m; i++){
        int a, b, c, d, e, f;
        cin >> a >> b >> c >> d >> e >> f;
        p[i] = {a, b, c, d, e, f};
        g[a].push_back({b, i});
        g[b].push_back({a, i});
    }
    
    vector<int> pos[2];

    vector<int> color(n + 1, - 1);

    auto dfs = [&](auto &&dfs, int u, int c) -> void {
        color[u] = c;
        pos[color[u]].push_back(u);
        for(auto [j, id] : g[u]){
            if (color[j] == -1){
                dfs(dfs, j, c ^ 1);
            }
        }
    };

    for(int i = 1; i <= n; i++){
        if (color[i] == -1){
            dfs(dfs, i, 0);
        }
    }

    if (pos[0].size() > pos[1].size()){
        swap(pos[0], pos[1]);
        for(auto &x : color) x ^= 1;
    }

    for(auto &[a, b, c, d, e, f] : p){
        if (color[a] == 1){
            swap(a, b);
            swap(d, e);
        }
    }

    vector<int> id(n);
    for(int i = 0; i < pos[0].size(); i++){
        id[pos[0][i]] = i;
    }
    
    int ans = 0;
    const int k = pos[0].size();
    for(int i = 0; i < 1 << k; i++){
        vector<array<int, 2> > sum(n + 1, {1, 1});
        for(auto [a, b, c, d, e, f] : p){
            int c1 = (i >> id[a] & 1);
            if (c1 == 0){
                sum[b][0] = mul(sum[b][0], c);
                sum[b][1] = mul(sum[b][1], d);
            }
            else{
                sum[b][0] = mul(sum[b][0], e);
                sum[b][1] = mul(sum[b][1], f);
            }
        }
        int res = 1;
        for(int j = 1; j <= n; j++){
            if (color[j] == 1){
                res = mul(res, sum[j][0] + sum[j][1]);
            }
        }
        add(ans, res);
    }
    cout << ans << '\n';

}