/*FreeTimeLove's code.
Love has a nasty habit of disappearing over night.*/
#include<bits/stdc++.h>
namespace FRTMLV{
#define ll long long
#define LD long double
#define i7 __int128
#define re return
#define con continue
using namespace std;
template<class T>inline bool ckmin(T &a,T b){re b<a?a=b,1:0;}
template<class T>inline bool ckmax(T &a,T b){re a<b?a=b,1:0;}
const int N=1e5+5;
inline int rd(){
	int ans=0,f=0;
	char ch=getchar();
	while(ch<'0'||ch>'9')f^=(ch=='-'),ch=getchar();
	while(ch>='0'&&ch<='9')ans=(ans<<3)+(ans<<1)+(ch^48),ch=getchar();
	re f?-ans:ans;
}
const int mod=1e9+7;
int n,m,id[N],dgr[N],bk[N],rk[N];
vector<int>e[N],E[N];
int cnt[N];
int main(){
	int T=rd();
	while(T--){
		n=rd(),m=rd();
		memset(dgr,0,sizeof dgr);
		memset(bk,0,sizeof bk);
		for(int i=1;i<=n;i++)id[i]=i,e[i].clear(),E[i].clear();
		for(int i=1;i<=m;i++){
			int u=rd(),v=rd();
			e[u].push_back(v),e[v].push_back(u);
			++dgr[u],++dgr[v];
		}
		sort(id+1,id+n+1,[](int x,int y){re dgr[x]>dgr[y];});
		for(int i=1;i<=n;i++)rk[id[i]]=i;
		for(int i=1;i<=n;i++)
			for(auto u:e[i])
				if(rk[i]<rk[u])E[i].push_back(u);
		ll ans=0;
		for(int i=1;i<=n;i++){
			ans+=(i7)dgr[i]*(dgr[i]-1)*(dgr[i]-2)*(dgr[i]-3)/24%mod;//juhua
			if(dgr[i]==1)con;
			ll sum=0,D=(ll)(dgr[i]-1)*(dgr[i]-2)/2;
			for(auto v:e[i]){
				ans+=sum*(dgr[v]-1)%mod;//chain
				ans+=D*(dgr[v]-1)%mod;//2-
				sum+=dgr[v]-1;
			}
		}
		for(int I=1;I<=n;I++){
			int i=id[I];
			for(auto u:E[i])bk[u]=i;//
			for(auto u:E[i]){
				for(auto v:e[u]){
					if(rk[v]>rk[u]&&bk[v]==i){
						ans+=(ll)(dgr[u]+dgr[v]+dgr[i]-6)*(mod+1-4)%mod;//3-ring-1
//						printf("[%d] ",dgr[u]+dgr[v]+dgr[i]-6);
						ans+=mod-3;//3-ring
//						ans+=cnt*(mod+1-4)%mod;//4-ring
					}
					if(rk[v]>rk[i]){
						ans+=(ll)(cnt[v]++)*(mod+1-4)%mod;//4-ring
//						printf("{%d} ",cnt[v]-1);
						
					}
				}
			}
			for(auto u:E[i]){
				if(rk[u]<rk[i])con;
				for(auto v:e[u])cnt[v]=0;
			}
		}
		printf("%lld\n",ans%mod);
	}
	re 0;
}
/*
1
6 5
1 2
2 3
3 4
3 5
3 6


*/
}int main(){re FRTMLV::main();}