#include <bits/stdc++.h>

using namespace std;

template <typename T>
T power(T a, long long b) {
  T r = 1;
  while (b) {
    if (b & 1) {
      r *= a;
    }
    a *= a;
    b >>= 1;
  }
  return r;
}

template <typename T>
T inverse(T a, T m) {
  a %= m;
  if (a < 0) {
    a += m;
  }
  T b = m, u = 0, v = 1;
  while (a) {
    T t = b / a;
    b -= a * t;
    swap(a, b);
    u -= v * t;
    swap(u, v);
  }
  if (u < 0) {
    u += m;
  }
  return u;
}

template <int _P>
struct modnum {
  static constexpr int P = _P;

 private:
  int v;

 public:
  modnum() : v(0) {
  }

  modnum(long long _v) {
    v = _v % P;
    if (v < 0) {
      v += P;
    }
  }

  explicit operator int() const {
    return v;
  }

  bool operator==(const modnum& o) const {
    return v == o.v;
  }

  bool operator!=(const modnum& o) const {
    return v != o.v;
  }

  modnum inverse() const {
    return modnum(::inverse(v, P));
  }

  modnum operator-() const {
    return modnum(v ? P - v : 0);
  }
  
  modnum operator+() const {
    return *this;
  }

  modnum& operator++() {
    v++;
    if (v == P) {
      v = 0;
    }
    return *this;
  }
  
  modnum& operator--() {
    if (v == 0) {
      v = P;
    }
    v--;
    return *this;
  }

  modnum operator++(int) {
    modnum r = *this;
    ++*this;
    return r;
  }
  
  modnum operator--(int) {
    modnum r = *this;
    --*this;
    return r;
  }

  modnum& operator+=(const modnum& o) {
    v += o.v;
    if (v >= P) {
      v -= P;
    }
    return *this;
  }

  modnum operator+(const modnum& o) const {
    return modnum(*this) += o;
  }

  modnum& operator-=(const modnum& o) {
    v -= o.v;
    if (v < 0) {
      v += P;
    }
    return *this;
  }

  modnum operator-(const modnum& o) const {
    return modnum(*this) -= o;
  }

  modnum& operator*=(const modnum& o) {
    v = (int) ((long long) v * o.v % P);
    return *this;
  }

  modnum operator*(const modnum& o) const {
    return modnum(*this) *= o;
  }
  
  modnum& operator/=(const modnum& o) {
    return *this *= o.inverse();
  }

  modnum operator/(const modnum& o) const {
    return modnum(*this) /= o;
  }
};

template <int _P>
ostream& operator<<(ostream& out, const modnum<_P>& n) {
  return out << int(n);
}

template <int _P>
istream& operator>>(istream& in, modnum<_P>& n) {
  long long _v;
  in >> _v;
  n = modnum<_P>(_v);
  return in;
}

using num = modnum<1000000007>;

struct dsu {
  vector<int> p;
  int n;

  dsu(int n) : n(n) {
    p.resize(n);
    iota(p.begin(), p.end(), 0);
  }

  int find(int v) {
    while (v != p[v]) {
      v = p[v] = p[p[v]];
    }
    return v;
  }

  bool unite(int v, int u) {
    v = find(v); u = find(u);
    if (v == u) {
      return false;
    } else {
      p[v] = u;
      return true;
    }
  }
};

struct edge {
  int v, u, w;

  bool operator<(const edge& o) const {
    return w < o.w;
  }
};

int main() {
#ifdef LOCAL
  freopen("input.txt", "r", stdin);
#endif
  ios::sync_with_stdio(false);
  cin.tie(0);
  int n, m;
  long long x;
  cin >> n >> m >> x;
  vector<edge> ed(m);
  for (int i = 0; i < m; ++i) {
    cin >> ed[i].v >> ed[i].u >> ed[i].w;
    --ed[i].v; --ed[i].u;
  }
  sort(ed.begin(), ed.end());
  int foo = 0;
  int bar = 0;
  int baz = 0;
  for (int i = 0; i < m; ++i) {
    long long y = ed[i].w;
    dsu d(n);
    d.unite(ed[i].v, ed[i].u);
    for (edge e : ed) {
      if (d.unite(e.v, e.u)) {
        y += e.w;
      }
    }
    if (y < x) {
     ++foo;
    } else if (y == x) {
     ++bar;
    } else {
     ++baz;
    } 
  }
  if (!bar) {
    cout << 0 << "\n";
  } else if (foo) {
    cout << (power(num(2), bar) - 1) * power(num(2), baz + 1) << "\n";
  } else {
    cout << (power(num(2), bar) - 2) * power(num(2), baz) << "\n";
  }
  return 0;
}


Measured memory_bytes: 384