#include <bits/stdc++.h>
using namespace std;

#define int long long
const int M = 1000000007;
int modpow(int n, int k) {
	int ans = 1;
	while (k) {
		if (k % 2) ans = (ans*n) % M;
		n = (n*n) % M; k /= 2;
	}
	return ans;
}

int c4(int n) {
	int p = n*(n-1)*(n-2)*(n-3) % M;
	int q = 1*2*3*4;
	return p*modpow(q, M-2) % M;
}

int c2(int n) {
	int p = n*(n-1);
	int q = 1*2;
	return p*modpow(q, M-2) % M;
}

typedef bitset<1000> bs;

void solve() {
	int n, m; cin >> n >> m;
	vector<bs> adj(n);

	while (m--) {
		int x, y; cin >> x >> y; x--, y--;
		adj[x][y] = adj[y][x] = 1;
	}

	int ans = 0;
	for (int i = 0; i < n; i++) {
		for (int j = 0; j < n; j++) {
			if (i == j) continue;

			int up = adj[i].count();
			int down = (adj[i] & adj[j]).count();

			if (up < 6 || down < 4) continue;
			int tmp = c4(down);
			tmp = (tmp*c2(up-4)) % M;

			ans = (ans+tmp) % M;
		}
	}
	cout << ans << '\n';
}

signed main() {
	ios::sync_with_stdio(0); cin.tie(0);

	int t; cin >> t;
	while (t--) {
		solve();
	}

	return 0;
}