#include <bits/stdc++.h>
using namespace std;

#define int long long

template<class T>bool chkmax(T &a,T b){return b>a?a=b,true:false;}
template<class T>bool chkmin(T &a,T b){return b<a?a=b,true:false;}

constexpr int inf=2e18;

template<const int mod>
struct modint{
	int x;
	modint(int x=0):x(norm(x%mod)){}
	int val()const{
		return x;
	}
	modint operator-()const{
		return modint(norm(mod-x));
	}
	int norm(int x)const{
		if(x<0) x+=mod;
		if(x>=mod) x-=mod;
		return x;
	}
	modint pow(int x)const{
		modint res=1;
		modint cur=*this;
		while(x){
			if(x&1){
				res*=cur;
			}
			cur*=cur;
			x/=2;
		}
		return res;
	}
	modint inv()const{
		assert(x!=0);
		return pow(mod-2);
	}
	modint &operator*=(const modint &rhs){
		x=(long long)(x)*rhs.x%mod;
		return *this;
	}
	modint &operator+=(const modint &rhs){
		x=norm(x+rhs.x);
		return *this;
	}
	modint &operator-=(const modint &rhs){
		x=norm(x-rhs.x);
		return *this;
	}
	modint &operator/=(const modint &rhs){
		return *this*=rhs.inv();
	}
	friend modint operator*(const modint &lhs,const modint &rhs){
		modint res=lhs;
		res*=rhs;
		return res;
	}
	friend modint operator+(const modint &lhs,const modint &rhs){
		modint res=lhs;
		res+=rhs;
		return res;
	}
	friend modint operator-(const modint &lhs,const modint &rhs){
		modint res=lhs;
		res-=rhs;
		return res;
	}
	friend modint operator/(const modint &lhs,const modint &rhs){
		modint res=lhs;
		res/=rhs;
		return res;
	}
	friend istream &operator>>(istream &is,modint &a){
		long long v;
		is>>v;
		a=modint(v);
		return is;
	}
	friend ostream &operator<<(ostream &os,const modint &a){
		return os<<a.val();
	}
	friend bool operator==(const modint &lhs,const modint &rhs){
		return lhs.val()==rhs.val();
	}
	friend bool operator!=(const modint &lhs,const modint &rhs){
		return lhs.val()!=rhs.val();
	}
};

using Mint=modint<(int)1e9+7>;

void solve(){
	int n,m;
	cin>>n>>m;
	vector<vector<pair<int,int>>>con(n);
	for(int i=0;i<m;i++){
		int l,r,x;
		cin>>l>>r>>x;
		l--,r--;
		con[r].emplace_back(l,x);
	}
	for(auto[l,x]:con[0]){
		if(x>1){
			cout<<"0\n";
			return;
		}
	}
	vector<vector<Mint>>dp(n+2,vector<Mint>(n+2));
	dp[-1+2][-2+2]=3;
	vector<pair<int,int>>alive;
	alive.emplace_back(-1,-2);
	for(int i=0;i<n-1;i++){
		int l_j=-inf,r_j=inf;
		int l_k=-inf,r_k=inf;
		for(auto[l,x]:con[i+1]){
			if(x==1){
				chkmin(r_j,l-1);
			}
			else if(x==2){
				chkmax(l_j,l);
				chkmin(r_k,l-1);
			}
			else{
				chkmax(l_k,l);
			}
		}
		vector<Mint>sum(n+2);
		for(auto[j,k]:alive){
			sum[j+2]+=dp[j+2][k+2];
			sum[k+2]+=dp[j+2][k+2];
		}
		for(int j=-2;j<i;j++){
			dp[i+2][j+2]+=sum[j+2];
		}
		for(int j=-2;j<i;j++){
			alive.emplace_back(i,j);
		}
		vector<pair<int,int>>nalive;
		for(auto[j,k]:alive){
			if(l_j<=j&&j<=r_j&&l_k<=k&&k<=r_k){
				nalive.emplace_back(j,k);
			}
			else{
				dp[j+2][k+2]=0;
			}
		}
		swap(alive,nalive);
	}
	Mint ans=0;
	for(auto[j,k]:alive){
		ans+=dp[j+2][k+2];
	}
	cout<<ans<<"\n";
}

signed main(){
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	cout.tie(nullptr);
	int T;
	cin>>T;
	while(T--){
		solve();
	}
	return 0;
}