#ifdef DEBUG
#define _GLIBCXX_DEBUG
#endif
//#pragma GCC optimize("O3")
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
const int mod = (int)1e9 + 7;
int mult(int a, int b) {
    return (1LL * a * b) % mod;
}
int sub(int a, int b) {
    int s = a - b;
    if (s < 0) s += mod;
    return s;
}
int pw(int a, int b) {
    if (b == 0) return 1;
    if (b & 1) return mult(a, pw(a, b - 1));
    int res = pw(a, b / 2);
    return mult(res, res);
}
int sum(int a, int b) {
    int s = a + b;
    if (s >= mod) s -= mod;
    return s;
}
const int maxN = 1005;
typedef bitset<maxN> bs;
bs a[maxN];
int deg[maxN];
void solve() {
    int n;
    cin >> n;
    for (int i = 1; i <= n; i++) {
        a[i] = 0;
        deg[i] = 0;
    }
    int m;
    cin >> m;
    while (m--) {
        int u, v;
        cin >> u >> v;
        a[u][v] = a[v][u] = 1;
        deg[u]++;
        deg[v]++;
    }
    int ans = 0;
    for (int i = 1; i <= n; i++) {
        for (int j = 1; j <= n; j++) {
            if (i == j) continue;
            int x = (a[i] & a[j]).count();
            ll coef = (1LL * x * (x - 1) * (x - 2) * (x - 3)) / 24;
            coef %= mod;
            int my_deg = deg[i] - 4;
            if (a[i][j]) my_deg--;
            coef *= ((1LL * my_deg * (my_deg - 1))) / 2;
            coef %= mod;
            ans = sum(ans, coef);
        }
    }
    cout << ans << '\n';
}
int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
#ifdef DEBUG
    freopen("input.txt", "r", stdin);
#endif
    int tst;
    cin >> tst;
    while (tst--) {
        solve();
    }
    return 0;
}