#include <bits/stdc++.h>
// #include <ext/pb_ds/tree_policy.hpp>
// #include <ext/pb_ds/assoc_container.hpp>
// using namespace __gnu_pbds;
// tree<int, null_type, less<int>, rb_tree_tag, tree_order_statistics_node_update> s;
using i64 = long long;
// using u32 = unsigned int;
// using u64 = unsigned long long;
// using i128 = __int128_t;
using namespace std;
const int N = 2e5 + 5;
// const int B = 455;
// const int M = 2e6 + 5;
// const int base = 13131;
// const int base = 17171;
// const int mod = 998244353;
const int mod = 1e9 + 7;
// const i64 mod = 1000000000000000003LL;
// const double pi = acos(-1);

void solve()
{
    int n, m;
    cin >> n >> m;
    vector<vector<array<int, 5>>> adj(n);
    for (int i = 0, a, b, c, d, e, f; i < m; i++)
    {
        cin >> a >> b >> c >> d >> e >> f;
        a--, b--;
        adj[a].push_back({b, c, d, e, f});
        adj[b].push_back({a, c, d, e, f});
    }
    vector<int> col(n, -1);
    auto dfs1 = [&](auto &dfs1, int cur) -> void
    {
        for (auto [i, c, d, e, f] : adj[cur])
        {
            if (col[i] == -1)
            {
                col[i] = col[cur] ^ 1;
                dfs1(dfs1, i);
            }
        }
    };
    for (int i = 0; i < n; i++)
        if (col[i] == -1)
            col[i] = 1, dfs1(dfs1, i);
    vector<vector<int>> num(2);
    for (int i = 0; i < n; i++)
        num[col[i]].push_back(i);
    if (num[0].size() > num[1].size())
        swap(num[0], num[1]);
    vector<vector<int>> val(2, vector<int>(n, 1));
    int ans = 0;
    auto dfs2 = [&](auto &dfs2, int cur) -> void
    {
        if (cur == num[0].size())
        {
            int tmp = 1;
            for (int i : num[1])
                tmp = (i64)tmp * (val[0][i] + val[1][i]) % mod;
            ans = (ans + tmp) % mod;
            return;
        }
        auto tmp = val;
        for (auto [i, c, d, e, f] : adj[num[0][cur]])
            val[0][i] = (i64)val[0][i] * c % mod,
            val[1][i] = (i64)val[1][i] * d % mod;
        dfs2(dfs2, cur + 1);
        val = tmp;
        for (auto [i, c, d, e, f] : adj[num[0][cur]])
            val[0][i] = (i64)val[0][i] * e % mod,
            val[1][i] = (i64)val[1][i] * f % mod;
        dfs2(dfs2, cur + 1);
        val = tmp;
    };
    dfs2(dfs2, 0);
    cout << ans << '\n';
}
signed main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    int t = 1;
    // cin >> t;
    cout << fixed << setprecision(10);
    while (t--)
        solve();
}