/*
世界の果てさえ
【世界的尽头在何处】
仆らは知らない
【我们也无从知晓】
*/
#include <cstdio>
#include <algorithm>
#include <cmath>
#include <cstring>
#include <vector>
#include <set>
#include <map>
#include <random>
#include <ctime>
#define pr pair <int, int>
#define mr make_pair
#define LL long long
#define ls tree[p].L
#define rs tree[p].R
using namespace std;
const int MAXN = 5e3 + 5, Mod = 1e9 + 7;
int T, n, m, L2[MAXN], R2[MAXN], L3[MAXN], R3[MAXN];
LL dp[MAXN][MAXN], H[MAXN], L[MAXN], nowl[MAXN], nowh[MAXN];
int down[MAXN], up[MAXN];
void read(int &x) {
	x = 0; bool f = 1; char C = getchar();
	for(; C < '0' || C > '9'; C = getchar()) if(C == '-') f = 0;
	for(; C >= '0' && C <= '9'; C = getchar()) x = (x << 1) + (x << 3) + (C ^ 48);
	x = (f ? x : -x);
}
int main() {
	for(scanf("%d", &T); T; T --) {
		read(n); read(m); int l, r, x;
		for(int i = 0; i <= n; i ++) R2[i] = R3[i] = MAXN, L2[i] = L3[i] = -MAXN, down[i] = 0, up[i] = n;
		for(int i = 1; i <= m; i ++) {
			read(l); read(r); read(x);
			if(x == 1) {
				R2[r] = min(R2[r], l - 1);
			}
			else if(x == 2) {
				L2[r] = max(L2[r], l); R3[r] = min(R3[r], l - 1);
			}
			else L3[r] = max(L3[r], l);
		}
		for(int i = 0; i <= n; i ++) for(int j = 0; j <= n; j ++) dp[i][j] = 0;
		for(int i = 0; i <= n; i ++) L[i] = H[i] = 0;
		dp[0][0] = 3; L[0] = 3; H[0] = 3;
		for(int i = 1; i <= n; i ++) {
			for(int j = 0; j <= n; j ++) nowl[j] = L[j], nowh[j] = H[j];
			if(L2[i] <= i - 1 && R2[i] >= i - 1 && i - 1) {
				for(int j = max(0, L3[i]); j <= min(i - 1, R3[i]); j ++) {
					dp[j][i - 1] = (dp[j][i - 1] + H[j] + L[j]) % Mod;
					nowh[i - 1] = (nowh[i - 1] + H[j] + L[j]) % Mod;
					nowl[j] = (nowl[j] + H[j] + L[j]) % Mod;
				}
			}
			for(int j = 0; j <= L3[i] - 1; j ++) {
				while(down[j] <= up[j]) {
					nowh[down[j]] = (nowh[down[j]] - dp[j][down[j]]) % Mod;
					nowl[j] = (nowl[j] - dp[j][down[j]]) % Mod; 
					down[j] ++;
				}
			}
			for(int j = R3[i] + 1; j <= n; j ++) {
				while(down[j] <= up[j]) {
					nowh[down[j]] = (nowh[down[j]] - dp[j][down[j]]) % Mod;
					nowl[j] = (nowl[j] - dp[j][down[j]]) % Mod; 
					down[j] ++;
				}
			}
			for(int j = max(0, L3[i]); j <= min(n, R3[i]); j ++) {
				while(down[j] <= up[j]) {
//					printf("|%d %d %d|\n", down[j], up[j], j); 
					if(down[j] < L2[i]) {
						nowh[down[j]] = (nowh[down[j]] - dp[j][down[j]]) % Mod;
						nowl[j] = (nowl[j] - dp[j][down[j]]) % Mod; 
						down[j] ++;
					}
					else if(up[j] > R2[i]) {
//						printf("?\n"); 
						nowh[up[j]] = (nowh[up[j]] - dp[j][up[j]]) % Mod;
						nowl[j] = (nowl[j] - dp[j][up[j]]) % Mod; 
						up[j] --;
					}
					else break;
				}
			}
			for(int j = 0; j <= n; j ++) H[j] = nowh[j], L[j] = nowl[j];//, printf("|%d %d|", H[j], L[j]);
//			printf("\n");
		}
		LL ans = 0;
		for(int i = 0; i <= n; i ++) ans = (ans + H[i]) % Mod;
		printf("%lld\n", (ans + Mod) % Mod);
	}
	return 0;
}
/*
4
1 0
2 0
3 0
5 2
1 3 3
4 5 1
*/