// clang-format off
#include<bits/stdc++.h>
#define pb push_back
#define P make_pair
#define fi first
#define se second
#define bit(s,x) (((s)>>(x))&1)
#define pnp(s) __builtin_popcountll(s)
#define rep(i,a,b) for(int i=(a);i<=(b);++i)
#define per(i,a,b) for(int i=(a);i>=(b);--i)
using namespace std;
typedef long long ll; 
typedef unsigned long long ull; 
typedef pair<int,int> pii; typedef pair<ll,int> pli; typedef pair<ll,ll> pll; typedef pair<int,ll> pil;
inline ll read(){
	ll x=0,f=1,c=getchar();
	while(c<'0'||c>'9')f=(c=='-'?-1:1),c=getchar();
	while(c>='0'&&c<='9')x=(x<<1)+(x<<3)+(c^48),c=getchar();
	return x*f;
}
const int mod=1e9+7;
inline void plust(int &x,int y){x=x+y>=mod?x+y-mod:x+y;}
inline void minut(int &x,int y){x=x-y<0?x-y+mod:x-y;}
const int N=5002;
// clang-format on
int n,m;
int a[N][N],b[N],c[N],lp[N],rp[N];
inline void add(int i,int j,int k){
	plust(a[i][j],k);
	plust(b[i],k); plust(c[j],k);
}
inline void del(int i,int j){
	int x=a[i][j];a[i][j]=0;
	minut(b[i],x),minut(c[j],x);
}
int ans;
int t1[N][3],t2[N][3];
inline void solve(){
	n=read(),m=read();
	bool fl=0;
	rep(i,1,n)rep(j,0,2)t1[i][j]=INT_MAX,t2[i][j]=-1;
	rep(i,1,m){
		int l=read(),r=read(),x=read()-1;
		if(l==1 && r==1 && x)fl=1;
		t1[r][x]=min(t1[r][x],l);
		t2[r][x]=max(t2[r][x],l);
	}
	if(fl){
		printf("0\n");
		goto clear;
	}
	add(0,0,1);
	lp[0]=rp[0]=0;
	rep(i,2,n){
		lp[i-1]=0,rp[i-1]=i-1;
		static int t[N];
		rep(j,0,i-1)t[j]=b[j]+c[j]>=mod?b[j]+c[j]-mod:b[j]+c[j];
		rep(j,0,i-1)add(i-1,j,t[j]);
			int lim;
			lim=t1[i][0];
			if(lim>=1 && lim<=n){
				rep(j,lim,i-1){
					rep(k,lp[j],rp[j])del(j,k);
					lp[j]=1,rp[j]=0;
				}
			}
			lim=t2[i][0];
			if(lim>=1 && lim<=n){
				rep(j,lim,i-1){
					rep(k,lp[j],rp[j])del(j,k);
					lp[j]=1,rp[j]=0;
				}
			}
			lim=t1[i][1];
			if(lim>=1 && lim<=n){
				rep(j,0,lim-1){
					rep(k,lp[j],rp[j])del(j,k);
					lp[j]=1,rp[j]=0;
				}
				rep(j,0,i-1)while(rp[j]>=lim && rp[j]>=lp[j])del(j,rp[j]),--rp[j];
			}
			lim=t2[i][1];
			if(lim>=1 && lim<=n){
				rep(j,0,lim-1){
					rep(k,lp[j],rp[j])del(j,k);
					lp[j]=1,rp[j]=0;
				}
				rep(j,0,i-1)while(rp[j]>=lim && rp[j]>=lp[j])del(j,rp[j]),--rp[j];
			}
			lim=t1[i][2];
			if(lim>=1 && lim<=n){
				rep(j,0,i-1)while(lp[j]<lim && rp[j]>=lp[j]) del(j,lp[j]),++lp[j];
			}
			lim=t2[i][2];
			if(lim>=1 && lim<=n){
				rep(j,0,i-1)while(lp[j]<lim && rp[j]>=lp[j]) del(j,lp[j]),++lp[j];
			}
	}
	ans=0;
	rep(j,0,n-1)plust(ans,3ll*b[j]%mod);
	printf("%d\n",ans);


clear:


	rep(i,0,n)rep(j,0,n)a[i][j]=0;
	rep(i,0,n)b[i]=c[i]=0;
}
int main() {
    //freopen("data.in", "r", stdin);
    // freopen(".in","r",stdin);
    // freopen("myans.out","w",stdout);
	int T=read();while(T--)solve();
    return 0;
}