// 
#include<bits/stdc++.h>
#define ll long long
using namespace std;
const int N=5010,mod=1e9+7;
int T,n,m,l1[N],r1[N],l2[N],r2[N];
ll sl[N],sr[N],f[N][N];
int cx[N],cy[N];
void clr_f(int i,int k){
	while(cx[i]<=k&&cx[i]<=cy[i]){
		sl[i]=(sl[i]-f[i][cx[i]]+mod)%mod;
		sr[cx[i]]=(sr[cx[i]]-f[i][cx[i]]+mod)%mod;
		f[i][cx[i]]=0;
		++cx[i];
	}
}
void clr_b(int i,int k){
	while(cy[i]>=k&&cx[i]<=cy[i]){
		sl[i]=(sl[i]-f[i][cy[i]]+mod)%mod;
		sr[cy[i]]=(sr[cy[i]]-f[i][cy[i]]+mod)%mod;
		f[i][cy[i]]=0;
		--cy[i];
	}
}
signed main(){
	scanf("%d",&T);
	for(;T--;){
		scanf("%d%d",&n,&m);
		for(int i=1;i<=n;i++){
			sl[i]=sr[i]=0;
			cx[i]=l1[i]=l2[i]=0;
			cy[i]=i,r1[i]=r2[i]=i-1;
		}
		for(int i=1,l,r,x;i<=m;i++){
			scanf("%d%d%d",&l,&r,&x);
			if(x==1){
				r1[r]=min(r1[r],l-1);
			}else if(x==2){
				l1[r]=max(l1[r],l);
				r2[r]=min(r2[r],l-1);
			}else{
				l2[r]=max(l2[r],l);
			}
		}
		f[0][0]=3;
		sl[0]=sr[0]=3;
		for(int i=2;i<=n;i++){
			for(int j=0;j+1<i;j++){
				f[i-1][j]=(sl[j]+sr[j])%mod;
				sl[i-1]=(sl[i-1]+f[i-1][j])%mod;
				sr[j]=(sr[j]+f[i-1][j])%mod;
			}
			for(int j=0;j<l1[i];j++)clr_f(j,j);
			for(int j=l1[i];j<=r1[i];j++)clr_f(j,l2[i]-1),clr_b(j,r2[i]+1);
			for(int j=r1[i]+1;j<i;j++)clr_f(j,j);
//			printf("work:%d\n",i);
//			printf("%d %d %d %d\n",l1[i],r1[i],l2[i],r2[i]);
//			for(int j=0;j<i;j++){
//				for(int k=0;k<=j;k++)if(f[j][k])printf("%d %d %d\n",j,k,f[j][k]);
//			}
		}
		int ans=0;
		for(int i=0;i<n;i++)ans=(ans+sl[i])%mod;
		printf("%d\n",ans);
	}
}