"""

まず、
連結成分ごとに考えられる
奇閉路がある場合、連結成分内が一意に決まる

Aが全てK以下の場合から、K-1以下の場合を引けばいい

全てK以下の場合の数を求めたい

"""

import sys
from sys import stdin
from collections import deque

mod = 10**9+7

def solve(LIM):

    state = [0] * N
    plus  = [0] * N
    ans = 1

    for i in range(N):

        maxx = LIM
        minx = 1
        X = None

        if state[i] == 0:
            nset = set([i])
            q = deque([i])
            state[i] = 1

            while q:
                v = q.popleft()
                #xの可能性範囲を狭める
                if state[v] == 1: # 1 <= X+plus[v] <= LIM
                    maxx = min(maxx,LIM-plus[v])
                    minx = max(minx,1-plus[v])
                else: # 1 <= -X+plus[v] <= LIM
                    maxx = min(maxx, plus[v]-1)
                    minx = max(minx,plus[v]-LIM)
                
                for nex,z in lis[v]:
                    
                    if state[nex] == 0: #新たに定義
                        state[nex] = -1 * state[v]
                        plus[nex] = z - plus[v]
                        q.append(nex)
                        
                    elif state[nex] != state[v]: #別側の場合、整合性チェック
                        if plus[v] + plus[nex] != z:
                            return 0

                    else: #同じ側の場合
                        if X == None: #Xが未定義の場合
                            if state[v] == 1: #2x+plus[v]+plus[nex] = z
                                x2 = z - plus[v] - plus[nex]
                                if x2 % 2 == 1 or x2 <= 0:
                                    return 0
                                else:
                                    X = x2 // 2
                            else: #-2x + p+p = z
                                x2 = plus[v] + plus[nex] - z
                                if x2 % 2 == 1 or x2 <= 0:
                                    return 0
                                else:
                                    X = x2 // 2
                        
                        else: #Xが定義済みの場合整合性チェック
                            if state[v] * X + plus[v] + state[nex] * X + plus[nex] != z:
                                return 0

            #可能性を書ける
            if X == None:
                ans *= max(0,maxx-minx+1)
            elif minx <= X <= maxx:
                ans *= 1
            else:
                ans *= 0
            ans %= mod
    return ans
    

N,M,K = map(int,stdin.readline().split())

lis = [ [] for i in range(N)]
for i in range(M):

    X,Y,Z = map(int,stdin.readline().split())
    X -= 1
    Y -= 1

    lis[X].append((Y,Z))
    lis[Y].append((X,Z))

print ((solve(K)-solve(K-1)) % mod)