#include<bits/stdc++.h>
#define int long long
using namespace std;
const int MAXN=5001,MOD=1e9+7;
int lj[MAXN],rj[MAXN],lk[MAXN],rk[MAXN];
int sumj[MAXN],sumk[MAXN],z[MAXN],dp[MAXN][MAXN];
deque <int> Q[MAXN];
inline void add(int j,int k,int z) {
	dp[j][k]=(dp[j][k]+z)%MOD;
	sumj[j]=(sumj[j]+z)%MOD;
	sumk[k]=(sumk[k]+z)%MOD;
//	printf("dp[%lld][%lld] = %lld\n",j,k,dp[j][k]);
}
inline void del(int j,int k) { /*printf("delete(%lld,%lld)\n",j,k);*/add(j,k,MOD-dp[j][k]); }
inline void solve() {
	int n,m;
	scanf("%lld%lld",&n,&m);
	for(int i=1;i<=n;++i) lj[i]=0,rj[i]=i-1,lk[i]=0,rk[i]=i-1;
	while(m--) {
		int l,r,c;
		scanf("%lld%lld%lld",&l,&r,&c);
		if(c==1) rj[r]=min(rj[r],l-1),rk[r]=min(rk[r],l-1);
		if(c==2) lj[r]=max(lj[r],l),rk[r]=min(rk[r],l-1);
		if(c==3) lj[r]=max(lj[r],l),lk[r]=max(lk[r],l);
	}
	add(0,0,1),Q[0].push_back(0);
	for(int i=1;i<=n;++i) {
//		printf("j in [%lld,%lld]  k in [%lld,%lld]\n",lj[i],rj[i],lk[i],rk[i]);
		for(int c=0;c<i;++c) z[c]=(sumj[c]+sumk[c])%MOD;
//		printf("Z = "); for(int c=0;c<i;++c) printf("%lld, ",z[c]); puts("");
		for(int c=0;c<i;++c) add(i-1,c,z[c]),Q[i-1].push_back(c);
		for(int j=0;j<i;++j) {
			if(lj[i]<=j&&j<=rj[i]) {
				while(!Q[j].empty()&&Q[j].front()<lk[i]) {
					del(j,Q[j].front());
					Q[j].pop_front();
				}
				while(!Q[j].empty()&&Q[j].back()>rk[i]) {
					del(j,Q[j].back());
					Q[j].pop_back();
				}
			} else {
				for(int x:Q[j]) del(j,x);
				Q[j].clear();
			}
		}
	}
	int ans=0;
	for(int j=0;j<=n;++j) for(int k=0;k<=n;++k) ans=(ans+dp[j][k])%MOD;
	printf("%lld\n",ans);
	for(int j=0;j<=n;++j) for(int k=0;k<=n;++k) dp[j][k]=0;
	for(int i=0;i<=n;++i) sumj[i]=sumk[i]=0,Q[i].clear();
}
signed main() {
	int T;
	scanf("%lld",&T);
	while(T--) solve();
	return 0;
}