#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
template <typename T> inline void chMax(T &a,T b) {a = max(a, b);}
template <typename T> inline void chMin(T &a,T b) {a = min(a, b);}
const int maxN = 5005, maxM = 1e6 + 5, Mod = 1e9 + 7;
int n, m;
struct Restriction {
	int l, r, x;
} R[maxM];
int cnt = 0, a[maxN];
bool app[3];
void dfs(int x) {
	if(x == n + 1) {
		bool flag = 1;
		for(int i = 1; i <= m; i++) {
			app[0] = app[1] = app[2] = 0;
			for(int j = R[i].l; j <= R[i].r; j++) {
				app[a[j]] = 1;
			}
			if(app[0] + app[1] + app[2] != R[i].x) {
				flag = 0;
				break;
			}
		}
		cnt += flag;
		return;
	}
	for(int i = 0; i <= 2; i++) {
		a[x] = i;
		dfs(x + 1);
	}
}
void solve() {
	cin >> n >> m;
	for(int i = 1; i <= m; i++) {
		cin >> R[i].l >> R[i].r >> R[i].x;
	}
	if(!m) {
		int ans = 1;
		for(int i = 1; i <= n; i++) ans = 3LL * ans % Mod;
		cout << ans << "\n";
		return;
	}
	dfs(1);
	cout << cnt << "\n";
}
int main() {
	ios::sync_with_stdio(false), cin.tie(0), cout.tie(0);
	int T; cin >> T;
	while(T--) solve();
	return 0;
}
/*
4
1 0
2 0
3 0
5 2
1 3 3
4 5 1

3
9
27
18
*/