#include <algorithm>
#include <cstring>
#include <cstdio>
#include <vector>
#include <queue>
#define mod 1000000007
using namespace std;
const int N = 5005;
int t, n, m, mx3[N], mn2[N], mx2[N], mn1[N], f[N][N], fx[N], fy[N], L[N], R[N], tp[N], ans;
inline void add(int& x, int y){x += y;if (x >= mod) x -= mod;}
inline void Add(int x, int y, int z){add(f[x][y], z), add(fx[x], z), add(fy[y], z);}
int main(){scanf("%d", &t);
	while (t --){scanf("%d%d", &n, &m), ans = 0;
		memset(mn2, -1, sizeof(mn2));
		memset(mx2, -1, sizeof(mx2));
		memset(mx3, -1, sizeof(mx3));
		for (int i = 1;i <= n;i ++) mn1[i] = i;
		for (int i = 1, l, r, x;i <= m;i ++){
			scanf("%d%d%d", &l, &r, &x);
			if (x == 1) mn1[r] = min(mn1[r], l);
			if (x == 2){
				if (mn2[r] == -1) mn2[r] = l;
				else mn2[r] = min(mn2[r], l);
				if (mx2[r] == -1) mx2[r] = l;
				else mx2[r] = max(mx2[r], l);
			}
			if (x == 3){
				if (mx3[r] == -1) mx3[r] = l;
				else mx3[r] = max(mx3[r], l);
			}
		}
		for (int i = 0;i <= n;i ++){
			for (int j = 0;j <= n;j ++) f[i][j] = 0;
			L[i] = 0, R[i] = -1, fx[i] = fy[i] = 0;
		}
		if (mx2[1] == -1 && mx3[1] == -1)
		Add(0, 0, 3), L[0] = R[0] = 0;
		else goto NO;
		for (int i = 2, Lj, Rj, Lk, Rk;i <= n;i ++){
			Lj = mx2[i] == -1 ? mx3[i] == -1 ? 0 : mx3[i] : mx2[i], Rj = mn1[i] - 1;
			Lk = mx3[i] == -1 ? 0 : mx3[i], Rk = mn2[i] == -1 ? mn1[i] - 1 : mn2[i] - 1;
			if (Lj > Rj || Lk > Rk) goto NO;
			if (Rj == i - 1) for (int o = Lk;o <= Rk;o ++) add(tp[o] = fx[o], fy[o]);
			for (int j = 0;j < i;j ++){
				if (j < Lj || j > Rj || R[j] < Lk || Rk < L[j]){
					for (int o = L[j];o <= R[j];o ++)
					Add(j, o, mod - f[j][o]);L[j] = 0, R[j] = -1;
				}
				else {
					while (L[j] < Lk) Add(j, L[j], mod - f[j][L[j]]), L[j] ++;
					while (Rk < R[j]) Add(j, R[j], mod - f[j][R[j]]), R[j] --;
				}
			}
			if (Rj == i - 1){L[i - 1] = Lk, R[i - 1] = Rk;
				for (int o = Lk;o <= Rk;o ++) Add(i - 1, o, tp[o]);
			}
		}
		for (int i = 0;i <= n;i ++)
		for (int j = 0;j <= n;j ++) add(ans, f[i][j]);
		NO:printf("%d\n", ans);
	}
}