#include<bits/stdc++.h>hjj shi gou
#define int long long
using namespace std;
const int N = 5010,M = 1e6+10,mod = 1e9+7;
int c,t,n,m,ans,sum[N],sum1[N],f[N][N],mx[N],mi[N],Mx[n],Mi[N],l,r,z;
vector<int>w1[N],w2[N];
inline int ksm(int x,int p)
{
	int ans = 1;
	while(p)
	{
		if((p&1)) ans = ans*x%mod;
		x = x*x%mod;
		p >>= 1;
	}
	return ans;
}
signed main()
{
//	freopen("stars.in","r",stdin);
//	freopen("stars.out","w",stdout);
	ios::sync_with_stdio(false);
	cin.tie(0); cout.tie(0);
	cin >> c >> t;
	while(t--)
	{
		cin >> n >> m;
		for(int i = 1;i <= n;i++) mi[i] = Mi[i] = 1e9,mx[i] = Mx[i] = -1e9;
		for(int i = 1;i <= m;i++)
		{
			cin >> l >> r >> z;
			if(z == 3) mi[r] = min(mi[r],l);
			else if(z == 1) mx[r] = max(mx[r],l);
			else Mi[r] = min(Mi[r],l),Mx[r] = max(Mx[r],l);
		}
		for(int i = 0;i <= n;i++) w1[i].clear(),w2[i].clear(),sum[i] = sum1[i] = 0;
		for(int i = 0;i <= n;i++)
			for(int j = 0;j <= n;j++)
				f[i][j] = 0;
		w1[0].push_back(0),w2[0].push_back(0),sum[0] = sum1[0] = f[0][0] = 3;
		for(int i = 0;i < n;i++)
		{
			for(int j = 1;j < i;j++) 
			{
				f[i][j] = (sum[j]+sum1[j])%mod; 
				w1[i].push_back(j); w2[j].push_back(i); 
			}
			for(int j = 1;j < i;j++) sum[i] = (sum[i]+f[i][j])%mod,sum1[j] = (sum1[j]+f[i][j])%mod;
		}
		cout << ans << '\n';
	}
	return 0;
}
/*
朴素dp为f_{i,j,k}表示填了前i个，最近三种不同的元素是i,j,k
f_{j,k} 可以转移三个状态
f_{j,k} f_{i,j} f_{i,k} 
*/

answer.code:1:28: warning: extra tokens at end of #include directive
    1 | #include<bits/stdc++.h>hjj shi gou
      |                            ^~~
answer.code:1:9: fatal error: bits/stdc++.h>hj: No such file or directory
    1 | #include<bits/stdc++.h>hjj shi gou
      |         ^~~~~~~~~~~~~~~~~~
compilation terminated.