#define _USE_MATH_DEFINES
#include <bits/stdc++.h>
using namespace std;
// #define int long long
// #define double long double
#define rep(i,n) for (int i=0; i<(int)(n); ++i)
#define rep1(i,n) for (int i=1; i<(int)(n); ++i)
#define repeq(i,n) for (int i=0; i<=(int)(n); ++i)
#define rep1eq(i,n) for (int i=1; i<=(int)(n); ++i)
#define rrep(i,n) for (int i=(int)(n)-1; i>=0; --i)
#define rrep1(i,n) for (int i=(int)(n)-1; i>0; --i)
#define rrepeq(i,n) for (int i=(int)(n); i>=0; --i)
#define rrep1eq(i,n) for (int i=(int)(n); i>0; --i)
#define REP(i,a,b) for (int i=(int)(a); i<=(int)(b); ++i)
#define RREP(i,a,b) for (int i=(int)(a); i>=(int)(b); --i)
#define ALL(a) (a).begin(), (a).end()
#define RALL(a) (a).rbegin(), (a).rend()
using ll = long long;
using vi = vector<int>;
using vl = vector<ll>;
using vb = vector<bool>;
template<typename T> using Graph = vector<vector<T>>;
template<typename T> using Spacial = vector<vector<vector<T>>>;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
const int MOD = 1e9+7;
const int MOD2 = 998244353;
// const double EPS = 1e-9;
const int dx[4] = {1, 0, -1, 0};
const int dy[4] = {0, 1, 0, -1};
string interval[2] = {" ", "\n"}; // {" ", "\n"}

template<typename T> struct is_plural : false_type{};
template<typename T1, typename T2> struct is_plural<pair<T1, T2>> : true_type{};
template<typename T> struct is_plural<vector<T>> : true_type{};
template<typename T> struct is_plural<complex<T>> : true_type{};
 
template<typename T1, typename T2> istream &operator>>(istream &is, pair<T1, T2> &p) { return is >> p.first >> p.second; }
template<typename T1, typename T2> ostream &operator<<(ostream &os, const pair<T1, T2> &p) { return os << p.first << " " << p.second; }
template<typename T> istream &operator>>(istream &is, vector<T> &vec) { for (auto itr = vec.begin(); itr != vec.end(); ++itr) is >> *itr; return is; }
template<typename T> ostream &operator<<(ostream &os, const vector<T> &vec) { if (vec.empty()) return os; bool pl = is_plural<T>(); os << vec.front(); for (auto itr = ++vec.begin(); itr != vec.end(); ++itr) os << interval[pl] << *itr; return os; }
 
bool CoutYN(bool a, string y = "Yes", string n = "No") { cout << (a ? y : n) << "\n"; return a; }

template<typename T1, typename T2> inline bool chmax(T1 &a, T2 b) { return a < b && (a = b, true); }
template<typename T1, typename T2> inline bool chmin(T1 &a, T2 b) { return a > b && (a = b, true); }

long long modpow(int a, long long n, int mod = MOD) { long long ret = 1; do { if (n & 1) ret = ret * a % mod; a = 1LL * a * a % mod; } while (n >>= 1); return ret; }

template<typename T1, typename T2> bool CompareBySecond(pair<T1, T2> a, pair<T1, T2> b) { return a.second != b.second ? a.second < b.second : a.first < b.first; }
// counterclockwise from 12 o'clock direction
template<typename T> bool CompareBySlope(pair<T, T> a, pair<T, T> b) { if (a.first * b.first < 0) return a.first < b.first; if (a.first == 0) return a.second >= 0 || b.first > 0; if (b.first == 0) return b.second < 0 && a.first < 0; return a.second * b.first < a.first * b.second; }


/* -------- <templates end> -------- */


template<typename T>
struct edge {
  int from, to;
  T cost;

  edge(int to, T cost) : from(-1), to(to), cost(cost) {}

  edge(int from, int to, T cost) : from(from), to(to), cost(cost) {}
};

template<typename T> using Edges = vector<edge<T>>;

struct UnionFind {
  vector<int> data;

  UnionFind(int sz) {
    data.assign(sz, -1);
  }

  bool unite(int x, int y) {
    x = find(x), y = find(y);
    if (x == y) return false;
    if (data[x] > data[y]) swap(x, y);
    data[x] += data[y];
    data[y] = x;
    return true;
  }

  int find(int k) {
    if (data[k] < 0) return k;
    return (data[k] = find(data[k]));
  }

  int size(int k) {
    return -data[find(k)];
  }
};

Edges<ll> g;

template<typename T>
T kruskal(Edges<T> &edges, int v) {
  sort(edges.begin(), edges.end(), [](const edge<T> &a, const edge<T> &b) {
    return a.cost < b.cost;
  });
  UnionFind tree(v);
  T ret = 0;
  for (auto &e : edges) {
    if (tree.unite(e.from, e.to)) {
      ret += e.cost;
      g.emplace_back(e);
      e.cost *= -1;
    }
  }
  return ret;
}

bool dfs(Graph<edge<ll>> &tree, int p, int v, int dest, deque<int> &dq) {
  for (auto &e : tree[v]) {
    if (e.to != p) {
      dq.emplace_back(e.cost);
      if (e.to == dest) return true;
      if (dfs(tree, v, e.to, dest, dq)) return true;
      dq.pop_back();
    }
  }
  return false;
}

void solve() {
  int n, m; ll x; cin >> n >> m >> x;
  Edges<ll> edges; edges.reserve(m);
  rep(i,m) {
    int u, v; ll w; cin >> u >> v >> w; --u, --v;
    edges.emplace_back(u, v, w);
  }
  
  g.reserve(n);
  ll w = kruskal(edges, n);
  
  if (x < w) {
    cout << 0 << endl;
    return;
  }

  Graph<edge<ll>> tree(n);
  for (auto &e : g) {
    tree[e.from].emplace_back(e.to, e.cost);
    tree[e.to].emplace_back(e.from, e.cost);
  }

  int cnt = 0, add = 0;

  for (auto &e : edges) {
    if (e.cost < 0) continue;
    deque<int> dq;

    dfs(tree, -1, e.from, e.to, dq);

    ll tmp = w - *max_element(ALL(dq)) + e.cost;

    if (tmp == x) ++cnt;
    else if (tmp > x) ++add;
  }

  ll ans = 2 * (modpow(2, cnt) - 1) * modpow(2, add) % MOD;

  if (x == w) {
    ans += (modpow(2, n-1) + MOD - 2) * modpow(2, m - (n-1));
    ans %= MOD;
  }

  cout << ans << endl;
}


/* -------- <programs end> -------- */


signed main() {
  cin.tie(nullptr);
  ios::sync_with_stdio(false);
  cout << fixed << setprecision(12);
  solve();
  return 0;
}


Measured memory_bytes: 512