#pragma GCC target("avx2")
#pragma GCC optimize("unroll-loops")
#pragma GCC optimize("Ofast")
#include <iostream>
#include <string>
#include <algorithm>
#include <vector>
#include <iomanip>
#include <cmath>
#include <stdio.h>
#include <queue>
#include <deque>
#include <cstdio>
#include <set>
#include <map>
#include <bitset>
#include <stack>
#include <cctype>
using namespace std;
int p[220], q[220], r[220];
int main() {
	long long mod = 1000000007;
	int m_size, m;
	cin >> m_size >> m;
	m_size = m;
	vector<vector<long long>> mat(220);
	long long y;
	cin >> y;
	y -= 3;
	vector<vector<long long>> ans(220);
	for (int i = 0; i < m_size; i++) {
		for (int j = 0; j < m_size; j++) {
			mat[i].emplace_back(0);
		}
	}
	int co = 0;
	for (int i = 0; i < m; i++) {
		cin >> p[i] >> q[i] >> r[i];
		if (y == 0 && p[i] == 1 && r[i] == 1) {
			co++;
		}
	}
	if (y == 0) {
		cout << co << endl;
		return 0;
	}
	for (int i = 0; i < m; i++) {
		for (int j = 0; j < m; j++) {
			if (q[i] == p[j] && r[i] == q[j]) {
				mat[j][i]++;
			}
		}
	}
	for (int i = 0; i < m_size; i++) {
		for (int j = 0; j < m_size; j++) {
			ans[i].emplace_back(mat[i][j]);
		}
	}
	y--;
	vector<vector<long long>> ans_mem(220);
	for (int i = 0; i < m_size; i++) {
		for (int j = 0; j < m_size; j++) {
			ans_mem[i].emplace_back(0);
		}
	}
	vector<vector<long long>> mat_mem(220);
	for (int i = 0; i < m_size; i++) {
		for (int j = 0; j < m_size; j++) {
			mat_mem[i].emplace_back(0);
		}
	}
	while (y > 0) {
		if ((y & 1) == 1) {
			for (int i = 0; i < m_size; i++) {
				for (int j = 0; j < m_size; j++) {
					ans_mem[i][j] = 0;
				}
			}
			for (int i = 0; i < m_size; i++) {
				for (int k = 0; k < m_size; k++) {
					for (int j = 0; j < m_size; j++) {
						ans_mem[i][j] += ans[i][k] * mat[k][j] % mod;
						if(ans_mem[i][j]>mod) ans_mem[i][j]-=mod; 
					}
				}
			}
			ans = ans_mem;
		}
		for (int i = 0; i < m_size; i++) {
			for (int j = 0; j < m_size; j++) {
				mat_mem[i][j] = 0;
			}
		}
		for (int i = 0; i < m_size; i++) {
			for (int k = 0; k < m_size; k++) {
				for (int j = 0; j < m_size; j++) {
					mat_mem[i][j] += mat[i][k] * mat[k][j] % mod;
					if(mat_mem[i][j]>mod)mat_mem[i][j]-=mod;
				}
			}
		}
		mat = mat_mem;
		y >>= 1;
	}
	long long ans1 = 0;
	for (int i = 0; i < m; i++) {;
		for (int j = 0; j < m; j++) {
			if (r[i] == 1 && p[j] == 1) {
				ans1 += ans[i][j];
				ans1 %= mod;
			}
		}
	}
	cout << ans1 << endl;
}