#include <bits/stdc++.h>
#include <unordered_map>
using i64 = long long;
constexpr i64 mod = 1e9 + 7;
constexpr int N = 1e3;
i64 pw(i64 x, i64 k) {
    i64 z = 1;
    while (k) {
        if (k & 1) {
            z = z * x % mod;
        }
        x = x * x % mod;
        k >>= 1;
    }
    return z;
}
std::vector<i64> fact(N), invf(N);
i64 C(int n, int m) {
    if (m > n) {
        return 0;
    }
    return fact[n] * invf[m] % mod * invf[n - m] % mod;
}
void work() {
    int n, m;
    std::cin >> n >> m;
    std::vector<int> u(m), v(m), p(n), q(n);
    for (int i = 0; i < n; ++i) {
        p[i] = i;
    }
    std::vector<std::unordered_set<int>> to(n);
    for (int i = 0; i < m; ++i) {
        std::cin >> u[i] >> v[i];
        --u[i], --v[i];
        to[u[i]].insert(v[i]);
        to[v[i]].insert(u[i]);
    }
    sort(p.begin(), p.end(), [&](int x, int y) {
        return to[x].size() == to[y].size() ? x < y : to[x].size() < to[y].size();
    });
    for (int i = 0; i < n; ++i) {
        q[p[i]] = i;
    }

    i64 sum = 1ll * m * (n + m - 3) % mod, cnt = 0;
    for (int i = 0; i < n; ++i) {
        int k = to[i].size();
        sum = (sum + C(k, 2)) % mod;
    }
    std::unordered_set<int> set;
    for (int i = 0; i < m; ++i) {
        int x = u[i], y = v[i];
        if (to[x].size() > to[y].size()) {
            std::swap(x, y);
        }
        set.clear();
        for (auto z : to[x]) {
            if (to[y].count(z)) {
                set.insert(z);
            }
        }
        sum = (sum + C(set.size(), 2) + set.size()) % mod;
        for (auto z : set) {
            if (q[z] > q[x] || q[z] > q[y]) {
                continue;
            }
            for (auto w : to[z]) {
                if (q[w] > q[x] || q[w] > q[y]) {
                    continue;
                }
                if (set.count(w)) {
                    ++cnt;
                }
            }
        }
    }
    sum = (sum - cnt / 2 * 3 + mod) % mod;
    std::cout << sum << "\n";
    return;
}
void init() {
    fact[0] = 1;
    for (int i = 1; i < N; ++i) {
        fact[i] = fact[i - 1] * i % mod;
    }
    invf[N - 1] = pw(fact[N - 1], mod - 2);
    for (int i = N - 1; i; --i) {
        invf[i - 1] = invf[i] * i % mod;
    }
}
int main() {
    init();
    std::ios::sync_with_stdio(false);
    std::cin.tie(nullptr), std::cout.tie(nullptr);
    int t = 1;
    std::cin >> t;
    while (t--) {
        work();
    }
    return 0;
}
/*


*/