#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
using namespace std;
using ll = long long;
using ull = unsigned long long;
using ld = long double;
template <typename T>
using mat = vector<vector<T>>;
template <int mod>
struct modint {
  int x;
  modint() : x(0) {}
  modint(int64_t y) : x(y >= 0 ? y % mod : (mod - (-y) % mod) % mod) {}
  modint &operator+=(const modint &p) {
    if ((x += p.x) >= mod) x -= mod;
    return *this;
  }
  modint &operator-=(const modint &p) {
    if ((x += mod - p.x) >= mod) x -= mod;
    return *this;
  }
  modint &operator*=(const modint &p) {
    x = (int)(1LL * x * p.x % mod);
    return *this;
  }
  modint &operator/=(const modint &p) {
    *this *= p.inverse();
    return *this;
  }
  modint operator-() const { return modint(-x); }
  modint operator+(const modint &p) const { return modint(*this) += p; }
  modint operator-(const modint &p) const { return modint(*this) -= p; }
  modint operator*(const modint &p) const { return modint(*this) *= p; }
  modint operator/(const modint &p) const { return modint(*this) /= p; }
  bool operator==(const modint &p) const { return x == p.x; }
  bool operator!=(const modint &p) const { return x != p.x; }
  modint inverse() const {
    int a = x, b = mod, u = 1, v = 0, t;
    while (b > 0) {
      t = a / b;
      swap(a -= t * b, b);
      swap(u -= t * v, v);
    }
    return modint(u);
  }
  modint pow(int64_t n) const {
    modint ret(1), mul(x);
    while (n > 0) {
      if (n & 1) ret *= mul;
      mul *= mul;
      n >>= 1;
    }
    return ret;
  }
  friend ostream &operator<<(ostream &os, const modint &p) { return os << p.x; }
  friend istream &operator>>(istream &is, modint &a) {
    int64_t t;
    is >> t;
    a = modint<mod>(t);
    return (is);
  }
  static int get_mod() { return mod; }
};
ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
ll lcm(ll a, ll b) { return a / gcd(a, b) * b; }
template <class T>
bool chmax(T &a, const T &b) {
  if (a < b) {
    a = b;
    return 1;
  }
  return 0;
}
template <class T>
bool chmin(T &a, const T &b) {
  if (b < a) {
    a = b;
    return 1;
  }
  return 0;
}
template <typename T>
T mypow(T x, ll n) {
  T ret = 1;
  while (n > 0) {
    if (n & 1) (ret *= x);
    (x *= x);
    n >>= 1;
  }
  return ret;
}
ll modpow(ll x, ll n, const ll mod) {
  ll ret = 1;
  while (n > 0) {
    if (n & 1) (ret *= x);
    (x *= x);
    n >>= 1;
    x %= mod;
    ret %= mod;
  }
  return ret;
}
uint64_t my_rand(void) {
  static uint64_t x = 88172645463325252ULL;
  x = x ^ (x << 13);
  x = x ^ (x >> 7);
  return x = x ^ (x << 17);
}
int popcnt(ull x) { return __builtin_popcountll(x); }
template <typename T>
struct edge {
  int src, to;
  T cost;
  edge(int to, T cost) : src(-1), to(to), cost(cost) {}
  edge(int src, int to, T cost) : src(src), to(to), cost(cost) {}
  edge &operator=(const int &x) {
    to = x;
    return *this;
  }
  operator int() const { return to; }
};
template <typename T>
using Edges = vector<edge<T>>;
template <typename T>
using WeightedGraph = vector<Edges<T>>;
using UnWeightedGraph = vector<vector<int>>;
struct Timer {
  clock_t start_time;
  void start() { start_time = clock(); }
  int lap() { return (clock() - start_time) * 1000 / CLOCKS_PER_SEC; }
};
const long double eps = 0.000001;
const long double PI = 3.141592653589793;
int main() {
  cin.tie(0);
  ios::sync_with_stdio(0);
  cout << setprecision(20);
  int n, m, q;
  cin >> n >> m >> q;
  WeightedGraph<ll> g(n);
  for (int _ = (0), max_i = (m); _ < max_i; _++) {
    int u, v;
    ll w;
    cin >> u >> v >> w;
    g[u - 1].emplace_back(v - 1, w);
    g[v - 1].emplace_back(u - 1, w);
  }
  vector<vector<long long>> dp(n + 1, vector<ll>(n, -1));
  dp[0][0] = 0;
  for (int i = (1), max_i = (n + 1); i < max_i; i++) {
    for (int j = (0), max_i = (n); j < max_i; j++) {
      if (dp[i - 1][j] == -1) continue;
      for (auto e : g[j]) {
        chmax(dp[i][e.to], dp[i - 1][j] + e.cost);
      }
    }
  }
  modint<1000000007LL> ans = 0;
  for (int i = (1), max_i = (min(q + 1, n + 1)); i < max_i; i++) {
    ans += *max_element((dp[i]).begin(), (dp[i]).end());
  }
  if (q < n) {
    cout << ans << '\n';
    return 0;
  }
  vector<ll> max_cost(n);
  for (int i = (0), max_i = (n); i < max_i; i++) {
    ll mx = -1;
    for (auto e : g[i]) {
      chmax(mx, e.cost);
    }
    max_cost[i] = mx;
  }
  vector<ll> left(n), right(n);
  for (int i = (0), max_i = (n); i < max_i; i++) {
    ll l = 0, r = 1000000005;
    auto f = [&](ll x) {
      ll mx = -1;
      for (int j = (0), max_i = (n); j < max_i; j++) {
        if (i == j) continue;
        chmax(mx, dp[n][j] + max_cost[j] * x + (j < i ? 1 : 0));
      }
      return dp[n][i] + max_cost[i] * x - mx;
    };
    while (r - l > 2) {
      ll lm = (l + l + r) / 3;
      ll rm = (l + r + r) / 3;
      if (f(lm) < f(rm))
        l = lm;
      else
        r = rm;
    }
    if (f(l + 1) < 0) continue;
    ll ok = l + 1, ng = 0;
    while (ok - ng > 1) {
      ll mid = (ok + ng) / 2;
      if (f(mid) >= 0)
        ok = mid;
      else
        ng = mid;
    }
    left[i] = ok;
    ok = l + 1, ng = q - n + 1;
    while (ng - ok > 1) {
      ll mid = (ok + ng) / 2;
      if (f(mid) >= 0)
        ok = mid;
      else
        ng = mid;
    }
    right[i] = ng;
    ll a = min((ll)q - n + 1, left[i]);
    ll b = min((ll)q - n + 1, right[i]);
    ans += (modint<1000000007LL>)dp[n][i] * (b - a) +
           (modint<1000000007LL>)(a + b - 1) * max_cost[i] * (b - a) / 2;
  }
  cout << ans << '\n';
}
