#include<bits/stdc++.h>
using namespace std;
#define pb push_back
using ll = long long;
using vi = vector<int>;
using vii = vector<vi>;
using vl = vector<ll>;
const int mod = 1e9 + 7;

ll qpow(ll x, ll k)
{
    ll res = 1;
    while (k)
    {
        if (k & 1) res = res * x % mod;
        k >>= 1;
        x = x * x % mod;
    }
    return res;
}

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

void solve(void)
{
    int n, m;
    cin >> n >> m;
    ll cnt3 = 0, cnt4 = 0;
    vi deg(n + 2), vis(n + 2);
    vii pre(n + 2), nxt(n + 2);

    for (int i = 1; i <= m; i++)
    {
        int u, v;
        cin >> u >> v;
        pre[u].pb(v), deg[u]++;
        pre[v].pb(u), deg[v]++;
    }

    for (int u = 1; u <= n; u++)
        for (auto v : pre[u])
            if (deg[u] < deg[v] || deg[u] == deg[v] && u < v)
                nxt[u].pb(v);
    
    ll ce = 0;
    ll ans = 0;
    for (int u = 1; u <= n; u++)
    {
        for (int v : nxt[u])
            vis[v] = 1;
        for (int v : nxt[u])
            for (int w : nxt[v])
            {
                add(cnt3, vis[w]);
                if (vis[w])
                {
                    assert(deg[u] >= 2);
                    add(ce, deg[u] - 2);
                    assert(deg[v] >= 2);
                    add(ce, deg[v] - 2);
                    assert(deg[w] >= 2);
                    add(ce, deg[w] - 2);
                }
            }
        for (int v : nxt[u])
            vis[v] = 0;  
    }

    for (int u = 1; u <= n; u++)
    {
        for (int v : pre[u])
            for (int w : nxt[v])
                if (deg[u] < deg[w] || deg[u] == deg[w] && u < w)
                    add(cnt4, vis[w]++);
        for (int v : pre[u])
            for (int w : nxt[v])
                vis[w] = 0;
    }

    ll sum = 0;
    for (int u = 1; u <= n; u++)
    {
        ll s1 = 0, s2 = 0;
        for (auto v : pre[u])
        {
            s1 += deg[v] - 1;
            s2 += 1LL * (deg[v] - 1) * (deg[v] - 1);
        }

        if (deg[u] >= 4)
        {
            ll c = deg[u];
            add(ans, c * (c - 1) % mod * (c - 2) % mod * (c - 3) % mod * qpow(2, mod - 2) % mod
                * qpow(3, mod - 2) % mod * qpow(4, mod - 2) % mod);
        }
        add(sum, (s1 * s1 - s2) / 2 % mod);
    }
    
    add(sum, - 3 * cnt3 % mod);
    add(sum, - 4 * cnt4 % mod);
    add(sum, - 2 * ce % mod);
    add(ans, sum);
    add(ans, cnt4);
    add(ans, ce);

    cout << ans << "\n";
}

int main()
{
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    
    int T = 1;
    cin >> T;
    for (int i = 1; i <= T; i++)
        solve();

    return 0;
}