#include <bits/stdc++.h>
using namespace std;
#define REP(i,a,n) for(int i=(a); i<(int)(n); i++)
#define rep(i,n) REP(i,0,n)
#define FOR(it,c) for(__typeof((c).begin()) it=(c).begin(); it!=(c).end(); ++it)
#define ALLOF(c) (c).begin(), (c).end()
typedef long long ll;
typedef unsigned long long ull;

typedef vector<ll> vec;
typedef vector<vec> mat;
const ll MOD = 1000000007;
mat mul(mat &A, mat &B){
  mat C(A.size(), vec(B[0].size()));
  rep(i,A.size()) rep(k,B.size()){
    rep(j,B[0].size()){
      C[i][j] = (C[i][j]+A[i][k]*B[k][j])%MOD;
    }
  }
  return C;
}
mat pow(mat A, ll n){
  mat B(A.size(), vec(A.size()));
  rep(i,A.size()) B[i][i] = 1;
  while(n>0){
    if(n&1) B=mul(B,A);
    A=mul(A,A);
    n>>=1;
  }
  return B;
}
vector<ll> mulv(mat &A, vector<ll> v){
  vector<ll> ret = v;
  rep(i,v.size()){
    ll res = 0;
    rep(j,v.size()){ res += A[i][j]*v[j]; res = res%MOD; }
    ret[i] = res%MOD;
  }
  return ret;
}

int main(){
  int K, M;
  ll N;
  cin >> K >> M >> N;
  vector<vector<int>> v;
  rep(i,M){
    int p, q, r;
    cin >> p >> q >> r;
    v.push_back({p,q,r});
  }

  vector<int> gl;
  mat A(M, vec(M, 0));
  vec x(M, 0);
  
  rep(i,M){
    if(v[i][0] == 1) x[i] = 1;
    if(v[i][2] == 1) gl.push_back(i);
    
    rep(j,M){
      if(v[i][1] == v[j][0] && v[i][2] == v[j][1]){
        A[i][j] = 1;
      }
    }
  }
  
  N-=2;

  mat B = pow(A, N);
  vec y = mulv(B, x);

  ll ans = 0;
  rep(i,gl.size()){
    ans += y[gl[i]];
    ans %= MOD;
  }
  cout << ans << endl;
  
  return 0;
}