import sys

# sys.setrecursionlimit(200005)
# sys.set_int_max_str_digits(1000005)
int1 = lambda x: int(x)-1
pDB = lambda *x: print(*x, end="\n", file=sys.stderr)
p2D = lambda x: print(*x, sep="\n", end="\n\n", file=sys.stderr)
def II(): return int(sys.stdin.readline())
def LI(): return list(map(int, sys.stdin.readline().split()))
def LLI(rows_number): return [LI() for _ in range(rows_number)]
def LI1(): return list(map(int1, sys.stdin.readline().split()))
def LLI1(rows_number): return [LI1() for _ in range(rows_number)]
def SI(): return sys.stdin.readline().rstrip()

dij = [(0, 1), (-1, 0), (0, -1), (1, 0)]
# dij = [(0, 1), (-1, 0), (0, -1), (1, 0), (1, 1), (1, -1), (-1, 1), (-1, -1)]
inf = (1 << 63)-1
md = 10**9+7
# md = 998244353

mx = 200005
pw = [1]*mx
ipw = [1]*mx
for i in range(mx-1): pw[i+1] = pw[i]*2%md
ipw[-1] = pow(pw[-1], md-2, md)
for i in range(mx-1)[::-1]: ipw[i] = ipw[i+1]*2%md

n, m = LI()
rtol = [-1]*(n+1)
ng = [0]*(n+2)
c = 0
mxl = -1
for _ in range(m):
    l, r, p = LI()
    if p:
        c += 1
        ng[l] += 1
        ng[r+1] -= 1
    else:
        rtol[r] = l
        mxl = max(mxl, l)
for i in range(n+1): ng[i+1] += ng[i]

# dpi=sum(dpj*2^(i-j-1))
# dpi=2^(i-1)*sum(dpj*2^(-j))
cs = [0]*(n+2)
cs[1] = 1

l = 0
ans = 0
if mxl == -1: ans = pw[n]
for i in range(1, n+1):
    cs[i+1] = cs[i]
    if ng[i]==0:
        v = pw[i-1]*(cs[i]-cs[l])%md
        if i >= mxl:
            ans += v*pw[n-i]%md
            ans %= md
        cs[i+1] += v*ipw[i]%md
        cs[i+1] %= md
    l = max(l, rtol[i])

ans *= ipw[c]
print(ans%md)