#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define db double
#define gc getchar
#define pb push_back
#define abs_(x) max(x,-(x))
#define tomin(x,y) x=min(x,y)
#define tomax(x,y) x=max(x,y)
#define For(i,a,b) for(int i=(a);i<=(b);i++)
#define dFor(i,a,b) for(int i=(a);i>=(b);i--)
#define all(x) x.begin(),x.end()
const int N=5005,P=1e9+7;
int read()
{
	int x=0; int y=1; char c=gc();
	for(;!isdigit(c);c=getchar()) if(c=='-') y=0;
	for(;isdigit(c);c=getchar()) x=(x<<3)+(x<<1)+(c^48);
	return y?x:-x;
}
int n,m;
struct _N
{
	int l,x;
};
vector<_N> g[N];
ll s1[N],s2[N];
int f[N][N],L[N],R[N];
void Cls()
{
	For(i,0,n) For(j,0,n) f[i][j]=0;
	For(i,0,n) s1[i]=s2[i]=0;
	For(i,0,n) L[i]=0,R[i]=max(0,i-1);
}
void add(int &x,int y) { x+=y; if(x>=P) x-=P; }
void Add(int i,int j,ll x)
{
	x%=P;
	s1[i]+=x;
	s2[j]+=x;
	add(f[i][j],x);
}
void cls(int i,int l,int r)
{
	while(L[i]<l)
	{
		Add(i,L[i],P-f[i][L[i]]);
		L[i]++;
	}
	while(R[i]>r)
	{
		Add(i,R[i],P-f[i][R[i]]);
		R[i]--;
	}
}
int work()
{
	n=read(),m=read();
	For(i,1,n) g[i].clear();
	For(i,1,m)
	{
		int l=read(),r=read(),x=read();
		g[r].pb((_N){l,x});
	}
	Cls();
	Add(0,0,3);
	For(i,1,n)
	{
		for(auto t:g[i])
		{
			int l=t.l,x=t.x;
			if(x==1)
			{
				For(j,l,i-1) cls(j,-1,-1);
			}
			if(x==2)
			{
				For(j,0,l-1) cls(j,-1,-1);
				For(j,0,i-1) cls(j,0,l-1);
			}
			if(x==3)
			{
				For(j,0,i-1) cls(j,l,i-1);
			}
		}
		if(i<n)
		{
			For(k,0,i-1) Add(i,k,s2[k]);
			For(j,0,i-1) Add(i,j,s1[j]); 
		}
	}
//	For(i,0,n)
//	{
//		For(j,0,n)
//		{
//			cout<<f[i][j]<<" ";
//		}
//		puts("");
//	}
//	For(i,0,n) cout<<"         "<<s1[i]<<" "<<s2[i]<<endl;
	ll ans=0;
	For(i,0,n) (ans+=s1[i])%=P;
	return ans;
}
signed main()
{
//	freopen("ex_color.in","r",stdin);
//	freopen("color.in","r",stdin);
//	freopen("color.out","w",stdout);
	int T=read();
	while(T--) printf("%d\n",work());
	return 0;
}


/*
4
1 0
2 0
3 0
5 2
1 3 3
4 5 1

1
5000 2
1 5 3
5 555 3


*/