#include <bits/stdc++.h>
using namespace std;

const long long MOD = 1000000007;
typedef long long LL;

const long long MOD_CONST = MOD;
long long mul_mod(long long a, long long b, const long long MOD) {
  return b ? (mul_mod(a * 2, b / 2, MOD) + (b & 1 ? a : 0)) % MOD : 0;
}

long long bpow_mod(long long a, long long b, const long long MOD) {
  return (b ? bpow_mod(a * a % MOD, b / 2, MOD) * (b & 1 ? a : 1) : 1) % MOD;
}

long long inv_mod(long long a, const long long MOD) {
  return bpow_mod(a, MOD - 2, MOD);
}
template <long long param = MOD_CONST, bool fast = false>
class mint {
 private:
  using Z = int;
  using N = unsigned int;
  using ZZ = long long;
  using NN = unsigned long long;
  struct {
  } constexpr static exact{};
  // Using Z deliberately to avoid Z -> N promotion.
  template <class Ret = ZZ&>
  static auto modulo() -> std::enable_if_t<(param <= 0), Ret> {
    static ZZ mod = 0;
    return mod;
  }
  template <class Ret = const ZZ>
  static auto mod() -> std::enable_if_t<(param <= 0), Ret> {
    return modulo();
  }
  template <class Ret = const ZZ>
  static constexpr auto mod() -> std::enable_if_t<(param > 0), Ret> {
    return param;
  }

 public:
  template <class Arg = ZZ>
  static void set_modulo(const std::enable_if_t<(param <= 0), Arg> mod) {
    modulo() = mod;
  }
  long long v;

  constexpr mint() : v(0) {}

  constexpr mint(long long v)
      : v(fast ? (v)
               : (v < 0 ? (v % mod() + mod()) % mod()
                        : (v >= mod() ? v % mod() : v))) {}
  constexpr long long get_mod() { return mod(); }
  long long get_val() { return v; }
  void take_mod() { v %= mod(); }
};
template <long long param, bool fast>
ostream& operator<<(ostream& os, mint<param, fast>& x) {
  return os << (x.v % x.get_mod() + x.get_mod()) % x.get_mod();
}

template <long long param, bool fast, bool fast2>
bool operator==(mint<param, fast>& a, mint<param, fast2> b) {
  return a.v == b.v;
}
template <long long param, bool fast, bool fast2>
mint<param, fast>& operator+=(mint<param, fast>& a, mint<param, fast2> b) {
  return a = a.v + b.v;
}
template <long long param>
mint<param>& operator-=(mint<param>& a, mint<param> b) {
  return a = a.v - b.v;
}
template <long long param>
mint<param>& operator*=(mint<param>& a, mint<param> b) {
  return a = a.v * b.v;
}
template <long long param>
mint<param>& operator/=(mint<param>& a, mint<param> b) {
  return a = a.v * inv_mod(b.v, a.get_mod());
}
template <long long param, bool fast, bool fast2>
mint<param, fast> operator+(mint<param, fast> a, mint<param, fast2> b) {
  return a += b;
}
template <long long param>
mint<param> operator-(mint<param> a, mint<param> b) {
  return a -= b;
}
template <long long param>
mint<param> operator*(mint<param> a, mint<param> b) {
  return a *= b;
}
template <long long param>
mint<param> operator/(mint<param> a, mint<param> b) {
  return a /= b;
}
template <long long param, bool fast>
mint<param, fast>& operator+=(mint<param, fast>& a, long long b) {
  return a = a.v + b;
}
template <long long param>
mint<param>& operator-=(mint<param>& a, long long b) {
  return a = a.v - b;
}
template <long long param>
mint<param>& operator*=(mint<param>& a, long long b) {
  return a = a.v * b;
}
template <long long param>
mint<param>& operator/=(mint<param>& a, long long b) {
  return a = a.v * inv_mod(b, a.get_mod());
}
template <long long param, bool fast>
mint<param, fast> operator+(mint<param> a, long long b) {
  return a += b;
}
template <long long param>
mint<param> operator-(mint<param> a, long long b) {
  return a -= b;
}
template <long long param>
mint<param> operator*(mint<param> a, long long b) {
  return a *= b;
}
template <long long param>
mint<param> operator/(mint<param> a, long long b) {
  return a /= b;
}

template <int size = 400000, long long param = MOD_CONST, bool preserve = false>
class CombinationTool {
  vector<mint<param>> invs;

 public:
  vector<mint<param>> kaijo;
  vector<vector<mint<param>>> table;

  CombinationTool() {
    int N = size;
    if (preserve) {
      table.resize(N + 5);
      for (int i = 0; i < N + 5; i++) table[i].resize(i + 1);
      for (int i = 0; i < N; i++) {
        table[i][0] = 1;
        table[i][i] = 1;
      }
      for (int i = 1; i < N + 5; i++)
        for (int j = 1; j < i; j++)
          table[i][j] = table[i - 1][j - 1] + table[i - 1][j];

    } else {
      kaijo.resize(N + 5);
      invs.resize(N + 5);
      kaijo[0] = 1;
      invs[0] = 1;
      for (int i = 1; i < N + 5; i++) {
        kaijo[i] = kaijo[i - 1] * i;
        invs[i] = mint<param>(1) / kaijo[i];
      }
    }
  }

  mint<param> get(int n, int m) {
    if (m < 0 || m > n) return mint<param>(0);
    if (preserve) return table[n][m];
    return kaijo[n] * invs[m] * invs[n - m];
  }
};

class UnionFind {
 public:
  vector<int> parent;
  vector<LL> cnt;
  UnionFind(int n) {
    parent = vector<int>(n);
    cnt = vector<LL>(n, 1);
    for (int i = 0; i < n; i++) parent[i] = i;
  }
  int find(int v) {
    if (v == parent[v]) return v;
    return parent[v] = find(parent[v]);
  }

  int uni(int u, int v) {
    u = find(u);
    v = find(v);
    if (u == v) return false;
    parent[u] = v;
    cnt[v] += cnt[u];
    return true;
  }
};

void solve(long long N, long long M, long long X, std::vector<long long> U,
           std::vector<long long> V, std::vector<long long> W) {
  LL cntA = 0;
  LL cntB = 0;
  LL cntC = 0;
  for (int i = 0; i < M; i++) {
    U[i]--;
    V[i]--;
  }
  vector<vector<LL>> data;
  for (int i = 0; i < M; i++) data.push_back({W[i], U[i], V[i]});
  sort(data.begin(), data.end());
  for (int fixed = 0; fixed < M; fixed++) {
    UnionFind uf(N);

    uf.uni(data[fixed][1], data[fixed][2]);
    LL cost = data[fixed][0];
    for (int i = 0; i < M; i++) {
      if (i == fixed) continue;
      if (uf.uni(data[i][1], data[i][2])) cost += data[i][0];
    }
    if (cost < X) cntA++;
    if (cost == X) cntB++;
    if (cost > X) cntC++;
  }
  mint<> ansA = 1;

  mint<> ansB = bpow_mod(2, cntB, MOD_CONST) - 1;
  mint<> ansC = bpow_mod(2, cntC, MOD_CONST);
  mint<> ans = ansA * ansB * ansC;
  if (cntA > 0) ans = ansA * ansB * ansC * 2;
  if (cntA == 0) {
    if (cntB > 0) ans = (ansB - 1) * ansC;
    if (cntB == 0) ans = 0;
  }
  cout << ans << endl;
}

// Generated by 1.1.4 https://github.com/kyuridenamida/atcoder-tools  (tips: You
// use the default template now. You can remove this line by using your custom
// template)
int main() {
  long long N;
  scanf("%lld", &N);
  long long M;
  scanf("%lld", &M);
  long long X;
  scanf("%lld", &X);
  std::vector<long long> U(M);
  std::vector<long long> V(M);
  std::vector<long long> W(M);
  for (int i = 0; i < M; i++) {
    scanf("%lld", &U[i]);
    scanf("%lld", &V[i]);
    scanf("%lld", &W[i]);
  }
  solve(N, M, X, std::move(U), std::move(V), std::move(W));
  return 0;
}


Measured memory_bytes: 384