import numpy as np
import sys

sys.setrecursionlimit(10 ** 6)

def II(): return int(sys.stdin.readline())
def MI(): return map(int, sys.stdin.readline().split())
def LI(): return list(map(int, sys.stdin.readline().split()))
def SI(): return sys.stdin.readline()[:-1]
def LLI(rows_number): return [LI() for _ in range(rows_number)]
def LLI1(rows_number): return [LI1() for _ in range(rows_number)]
int1 = lambda x: int(x) - 1
def MI1(): return map(int1, sys.stdin.readline().split())
def LI1(): return list(map(int1, sys.stdin.readline().split()))
p2D = lambda x: print(*x, sep="\n")
dij = [(1, 0), (0, 1), (-1, 0), (0, -1)]

md=10**9+7
k,m,n=MI()
pqr=LLI(m)
if n==3:
    ans=0
    for p,q,r in pqr:
        if p==1 and r==1:ans+=1
    print(ans)
    exit()
to=np.zeros((m,m),dtype=object)
for i in range(m):
    for j in range(m):
        if pqr[i][1:]==pqr[j][:2]:to[i][j]=1
#print(to)
cnt=np.eye(m,dtype=object)
n-=3
while n:
    if n&1:cnt=np.dot(cnt,to)%md
    to=np.dot(to,to)%md
    n>>=1
#print(cnt)

start=[]
end=[]
for i,(p,q,r) in enumerate(pqr):
    if p==1:start.append(i)
    if r==1:end.append(i)
ans=0
for s in start:
    for e in end:
        ans+=cnt[s][e]
        ans%=md
print(ans)