#include<bits/stdc++.h>
#define mod 1000000007
using namespace std;
inline int read()
{
	int n=0,f=1,ch=getchar();
	while(ch<'0'||ch>'9')
	{
		if(ch=='-')f=-1;
		ch=getchar();
	}
	while(ch>='0'&&ch<='9')
	{
		n=n*10+ch-'0';
		ch=getchar();
	}
	return n*f;
}
int l1[5005],r1[5005];
int l2[5005],r2[5005];
int preh[5005][5005],nexh[5005][5005];
int dp[5005][5005];
int heh[5005],hel[5005];
int main()
{
	int t,n,m,l,r,x;
	t=read();
	for(int greg=1;greg<=t;greg++)
	{
		n=read();
		m=read();
		for(int i=1;i<=n;i++)
		{
			l1[i]=0;
			r1[i]=i-1;
			l2[i]=0;
			r2[i]=i-1;
		}
		for(int i=1;i<=n+1;i++)
		{
			for(int j=0;j<=n+1;j++)
			{
				nexh[i][j]=0;
				preh[i][j]=0; 
				dp[i][j]=0;
			}
		}
		for(int i=1;i<=n+1;i++)
		{
			preh[i][n+1]=0;
			nexh[i][0]=n+1;
			heh[i]=0;
			hel[i]=0; 
		}
		for(int i=1;i<=m;i++)
		{
			l=read();
			r=read();
			x=read();
			if(x==3)
			{
				l1[r]=max(l1[r],l);
			}
			else if(x==2)
			{
				r1[r]=min(r1[r],l-1);
				l2[r]=max(l2[r],l); 
			}
			else if(x==1)
			{
				r2[r]=min(r2[r],l-1);
			}
		}
		if(m==1000000)break;
		//for(int i=1;i<=n;i++)printf("%d %d %d %d\n",l1[i],r1[i],l2[i],r2[i]);
		heh[1]=3;
		hel[1]=3;
		dp[1][1]=3;
		nexh[1][0]=1;
		preh[1][1]=0;
		nexh[1][1]=n+1;
		preh[1][n+1]=1;
		if(l1[1]>0||l2[1]>0)
		{
			printf("0\n");
			continue;
		}
		for(int i=2;i<=n;i++)
		{
			for(int j=0;j<=i-2;j++)
			{
				dp[j+1][i]=(heh[j+1]+hel[j+1])%mod;
				nexh[j+1][i]=n+1;
				preh[j+1][i]=preh[j+1][n+1];
				nexh[j+1][preh[j+1][n+1]]=i;
				preh[j+1][n+1]=i;
			}
			for(int j=0;j<=i-2;j++)
			{
				heh[j+1]=(heh[j+1]+dp[j+1][i])%mod;
				hel[i]=(hel[i]+dp[j+1][i])%mod;
			}
			for(int j=1;j<=i-1;j++)
			{
				if(j-1<l1[i]||j-1>r1[i])
				{
					int sth=nexh[j][0];
					//printf("orz%d\n",sth);
					while(sth!=n+1)
					{
						heh[j]=(heh[j]+mod-dp[j][sth])%mod;
						hel[sth]=(hel[sth]+mod-dp[j][sth])%mod;
						dp[j][sth]=0;
						sth=nexh[j][sth];
					}
				}
				else
				{
					int sth=nexh[j][0];
					while(sth-1<l2[i])
					{
						heh[j]=(heh[j]+mod-dp[j][sth])%mod;
						hel[sth]=(hel[sth]+mod-dp[j][sth])%mod;
						dp[j][sth]=0;
						sth=nexh[j][sth];
					}
					nexh[j][0]=sth;
					preh[j][sth]=0;
					sth=preh[j][n+1];
					while(sth-1>r2[i])
					{
						//printf("orz%d %d\n",j,sth);
						heh[j]=(heh[j]+mod-dp[j][sth])%mod;
						hel[sth]=(hel[sth]+mod-dp[j][sth])%mod;
						dp[j][sth]=0;
						sth=preh[j][sth];
					}
					nexh[j][sth]=n+1;
					preh[j][n+1]=sth;
				}
			}
			//printf("orz%d\n",i);
			/*for(int j=1;j<=i;j++)
			{
				for(int k=j;k<=i;k++)printf("%d ",dp[j][k]);
				printf("\n");
			}*/
		}
		int ans=0;
		for(int i=1;i<=n+1;i++)
		{
			for(int j=1;j<=n+1;j++)
			{
				ans=(ans+dp[i][j])%mod;
			}
		}
		printf("%d\n",ans);
	}
	return 0;
}