#include <bits/stdc++.h>
long long dx[8] = {0, 1, 0, -1, 1, 1, -1, -1};
long long dy[8] = {1, 0, -1, 0, -1, 1, 1, -1};
using namespace std;
class pa3 {
 public:
  long long x;
  long long y, z;
  pa3(long long x = 0, long long y = 0, long long z = 0) : x(x), y(y), z(z) {}
  bool operator<(const pa3 &p) const {
    if (x != p.x) return x < p.x;
    if (y != p.y) return y < p.y;
    return z < p.z;
  }
  bool operator>(const pa3 &p) const {
    if (x != p.x) return x > p.x;
    if (y != p.y) return y > p.y;
    return z > p.z;
  }
  bool operator==(const pa3 &p) const {
    return x == p.x && y == p.y && z == p.z;
  }
  bool operator!=(const pa3 &p) const {
    return !(x == p.x && y == p.y && z == p.z);
  }
};
class pa4 {
 public:
  long long x;
  long long y, z, w;
  pa4(long long x = 0, long long y = 0, long long z = 0, long long w = 0)
      : x(x), y(y), z(z), w(w) {}
  bool operator<(const pa4 &p) const {
    if (x != p.x) return x < p.x;
    if (y != p.y) return y < p.y;
    if (z != p.z) return z < p.z;
    return w < p.w;
  }
  bool operator>(const pa4 &p) const {
    if (x != p.x) return x > p.x;
    if (y != p.y) return y > p.y;
    if (z != p.z) return z > p.z;
    return w > p.w;
  }
  bool operator==(const pa4 &p) const {
    return x == p.x && y == p.y && z == p.z && w == p.w;
  }
};
class pa2 {
 public:
  long long x, y;
  pa2(long long x = 0, long long y = 0) : x(x), y(y) {}
  pa2 operator+(pa2 p) { return pa2(x + p.x, y + p.y); }
  pa2 operator-(pa2 p) { return pa2(x - p.x, y - p.y); }
  bool operator<(const pa2 &p) const { return y != p.y ? y < p.y : x < p.x; }
  bool operator>(const pa2 &p) const { return x != p.x ? x < p.x : y < p.y; }
  bool operator==(const pa2 &p) const {
    return abs(x - p.x) == 0 && abs(y - p.y) == 0;
  }
  bool operator!=(const pa2 &p) const {
    return !(abs(x - p.x) == 0 && abs(y - p.y) == 0);
  }
};
string itos(long long i) {
  ostringstream s;
  s << i;
  return s.str();
}
long long Gcd(long long v, long long b) {
  if (v == 0) return b;
  if (b == 0) return v;
  if (v > b) return Gcd(b, v);
  if (v == b) return b;
  if (b % v == 0) return v;
  return Gcd(v, b % v);
}
long long mod;
long long extgcd(long long a, long long b, long long &x, long long &y) {
  if (b == 0) {
    x = 1;
    y = 0;
    return a;
  }
  long long d = extgcd(b, a % b, y, x);
  y -= a / b * x;
  return d;
}
pair<long long, long long> operator+(const pair<long long, long long> &l,
                                     const pair<long long, long long> &r) {
  return {l.first + r.first, l.second + r.second};
}
pair<long long, long long> operator-(const pair<long long, long long> &l,
                                     const pair<long long, long long> &r) {
  return {l.first - r.first, l.second - r.second};
}
long long beki(long long wa, long long rr, long long warukazu) {
  if (rr == 0) return 1 % warukazu;
  if (rr == 1) return wa % warukazu;
  wa %= warukazu;
  if (rr % 2 == 1)
    return ((long long)beki(wa, rr - 1, warukazu) * (long long)wa) % warukazu;
  long long zx = beki(wa, rr / 2, warukazu);
  return (zx * zx) % warukazu;
}
long long pr[1000100];
long long inv[1000110];
long long comb(long long nn, long long rr) {
  if (rr < 0 || rr > nn || nn < 0) return 0;
  long long r = pr[nn] * inv[rr];
  r %= mod;
  r *= inv[nn - rr];
  r %= mod;
  return r;
}
void gya(long long ert) {
  pr[0] = 1;
  for (long long i = 1; i <= ert; i++) {
    pr[i] = ((long long)pr[i - 1] * i) % mod;
  }
  inv[ert] = beki(pr[ert], mod - 2, mod);
  for (long long i = ert - 1; i >= 0; i--) {
    inv[i] = (long long)inv[i + 1] * (i + 1) % mod;
  }
}
long long dp[2020][2020];
vector<pair<long long, long long> > G[2020];
long long W[2020];
signed main() {
  long long n, m, q;
  cin >> n >> m >> q;
  for (long long i = 0; i < m; i++) {
    long long y, yy, yyy;
    cin >> y >> yy >> yyy;
    G[y].push_back(make_pair(yy, yyy));
    G[yy].push_back(make_pair(y, yyy));
  }
  for (long long i = 0; i <= 2010; i++)
    for (long long j = 0; j <= 2000; j++) dp[i][j] = -1;
  dp[0][1] = 0;
  for (long long t = 0; t <= 2000; t++) {
    W[t] = 0;
    for (long long i = 1; i <= n; i++) W[t] = max(W[t], dp[t][i]);
    for (long long i = 1; i <= n; i++)
      if (dp[t][i] >= 0)
        for (auto v : G[i])
          dp[t + 1][v.first] = max(dp[t + 1][v.first], dp[t][i] + v.second);
  }
  long long ans = 0;
  for (long long i = 1; i <= min(q, 2000ll); i++) {
    ans += W[i];
  }
  if (q <= 2000ll) {
    cout << ans % 1000000007 << endl;
    return 0;
  }
  vector<pair<long long, long long> > ve;
  for (long long i = 1; i <= n; i++)
    for (auto v : G[i])
      if (i < v.first) {
        long long p = i, q = v.first, c = v.second;
        long long g = 1000000007 * 100000000ll;
        for (long long j = 0; j <= 2000; j++) {
          if (dp[j][p] >= 0) g = min(g, j * c - dp[j][p]);
        }
        for (long long j = 0; j <= 2000; j++) {
          if (dp[j][q] >= 0) g = min(g, j * c - dp[j][q]);
        }
        ve.push_back(make_pair(c, -g));
      }
  long long ni = beki(2, 1000000007 - 2, 1000000007);
  for (long long i = 0; i < m; i++) {
    long long ue = q;
    long long si = 2001;
    long long a = ve[i].first, b = ve[i].second;
    for (long long j = 0; j < m; j++)
      if (j != i) {
        long long c = ve[j].first, d = ve[j].second;
        if (i < j) {
          if (a - c > 0) {
            if (d - b <= 0)
              continue;
            else {
              si = max(si, (d - b) / (a - c) + !!((d - b) % (a - c)));
            }
          } else if (a == c) {
            if (b < d)
              ue = -1, si = 1000000007;
            else
              continue;
          } else {
            if (b - d <= 0)
              ue = -1;
            else
              ue = min(ue, (b - d) / (c - a));
          }
        } else {
          if (a - c > 0) {
            if (d - b <= 0)
              continue;
            else {
              si = max(si, (d - b) / (a - c) + 1);
            }
          } else if (a == c) {
            if (b <= d)
              ue = -1, si = 1000000007;
            else
              continue;
          } else {
            if (b - d <= 0)
              ue = -1;
            else
              ue = min(ue, (b - d) / (c - a) + !!((b - d) % (c - a)) - 1);
          }
        }
      }
    if (si <= ue) {
      ans += (a * si + b + a * ue + b) % 1000000007 * (ue - si + 1) %
             1000000007 * ni % 1000000007;
    }
  }
  cout << ans % 1000000007 << endl;
  return 0;
}
