#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 nl[5005],nr[5005];
int dp[5005][5005];
int heh[5005],hel[5005];
int main()
{
	int t,n,m;
	int 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++)
		{
			nl[i]=1;
			nr[i]=0;
			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));
			}
		}
		//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;
		nl[1]=1;
		nr[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)?heh[j+1]+hel[j+1]-mod:heh[j+1]+hel[j+1];
			}
			nl[i]=1;
			nr[i]=i-1;
			for(int j=0;j<=i-2;j++)
			{
				heh[j+1]=(heh[j+1]+dp[j+1][i]>=mod)?heh[j+1]+dp[j+1][i]-mod:heh[j+1]+dp[j+1][i];
				hel[i]=(hel[i]+dp[j+1][i]>=mod)?hel[i]+dp[j+1][i]-mod:hel[i]+dp[j+1][i];
			}
			for(int j=1;j<=i;j++)
			{
				if(j-1<l2[i]||j-1>r2[i])
				{
					for(int sth=nl[j];sth<=nr[j];sth++)
					{
						//printf("del:%d %d\n",sth,j); 
						heh[sth]=(heh[sth]-dp[sth][j]>=0)?heh[sth]-dp[sth][j]:heh[sth]+mod-dp[sth][j];
						hel[j]=(hel[j]-dp[sth][j]>=0)?hel[j]-dp[sth][j]:hel[j]+mod-dp[sth][j];
						dp[sth][j]=0;
					}
					nl[j]=1;
					nr[j]=0;
				}
				else
				{
					for(int sth=nl[j];sth<l1[i]+1;sth++)
					{
						//printf("del:%d %d\n",sth,j);
						heh[sth]=(heh[sth]-dp[sth][j]>=0)?heh[sth]-dp[sth][j]:heh[sth]+mod-dp[sth][j];
						hel[j]=(hel[j]-dp[sth][j]>=0)?hel[j]-dp[sth][j]:hel[j]+mod-dp[sth][j];
						dp[sth][j]=0;
					}
					nl[j]=max(nl[j],l1[i]+1);
					for(int sth=r1[i]+2;sth<nr[j];sth++)
					{
						//printf("del:%d %d\n",sth,j);
						heh[sth]=(heh[sth]-dp[sth][j]>=0)?heh[sth]-dp[sth][j]:heh[sth]+mod-dp[sth][j];
						hel[j]=(hel[j]-dp[sth][j]>=0)?hel[j]-dp[sth][j]:hel[j]+mod-dp[sth][j];
						dp[sth][j]=0;
					}
					nr[j]=min(nr[j],r1[i]+1);
				}
			}
			/*printf("orz\n"); 
			for(int j=1;j<=i;j++)
			{
				for(int k=1;k<=i;k++)printf("%d ",dp[j][k]);
				printf("\n");
			}*/
		}
		int ans=0;
		for(int i=1;i<=n+1;i++)
		{
			for(int j=nl[i];j<=nr[i];j++)
			{
				ans=(ans+dp[j][i]>=mod)?ans+dp[j][i]-mod:ans+dp[j][i];
			}
		}
		printf("%d\n",ans);
	}
	return 0;
}