#include <bits/stdc++.h>

using namespace std;
#define FOR(i,n) for(int i = 0; i < (n); i++)
#define sz(c) ((int)c.size())
#define ten(n) ((int)1e##n)
using ll = long long;
using Pii = pair<int, int>;
using Pll = pair<ll, ll>;

template<typename ...> static inline int getchar_unlocked(void) { return getchar(); }
template<typename ...> static inline void putchar_unlocked(int c) { putchar(c); }
#define mygc(c) (c)=getchar_unlocked()
#define mypc(c) putchar_unlocked(c)
void reader(int& x) { int k, m = 0; x = 0; for (;;) { mygc(k); if (k == '-') { m = 1; break; }if ('0' <= k&&k <= '9') { x = k - '0'; break; } }for (;;) { mygc(k); if (k<'0' || k>'9')break; x = x * 10 + k - '0'; }if (m) x = -x; }
void reader(ll& x) { int k, m = 0; x = 0; for (;;) { mygc(k); if (k == '-') { m = 1; break; }if ('0' <= k&&k <= '9') { x = k - '0'; break; } }for (;;) { mygc(k); if (k<'0' || k>'9')break; x = x * 10 + k - '0'; }if (m) x = -x; }
int reader(char c[]) { int i, s = 0; for (;;) { mygc(i); if (i != ' '&&i != '\n'&&i != '\r'&&i != '\t'&&i != EOF) break; }c[s++] = i; for (;;) { mygc(i); if (i == ' ' || i == '\n' || i == '\r' || i == '\t' || i == EOF) break; c[s++] = i; }c[s] = '\0'; return s; }
int reader(string& c) { int i; for (;;) { mygc(i); if (i != ' '&&i != '\n'&&i != '\r'&&i != '\t'&&i != EOF) break; }c.push_back(i); for (;;) { mygc(i); if (i == ' ' || i == '\n' || i == '\r' || i == '\t' || i == EOF) break; c.push_back(i); }; return sz(c); }
template <class T, class S> void reader(T& x, S& y) { reader(x); reader(y); }
template <class T, class S, class U> void reader(T& x, S& y, U& z) { reader(x); reader(y); reader(z); }
template <class T, class S, class U, class V> void reader(T& x, S& y, U& z, V & w) { reader(x); reader(y); reader(z); reader(w); }
void writer(int x, char c) { int s = 0, m = 0; char f[10]; if (x<0)m = 1, x = -x; while (x)f[s++] = x % 10, x /= 10; if (!s)f[s++] = 0; if (m)mypc('-'); while (s--)mypc(f[s] + '0'); mypc(c); }
void writer(ll x, char c) { int s = 0, m = 0; char f[20]; if (x<0)m = 1, x = -x; while (x)f[s++] = x % 10, x /= 10; if (!s)f[s++] = 0; if (m)mypc('-'); while (s--)mypc(f[s] + '0'); mypc(c); }
void writer(const char c[]) { int i; for (i = 0; c[i] != '\0'; i++)mypc(c[i]); }
void writer(const string& x, char c) { int i; for (i = 0; x[i] != '\0'; i++)mypc(x[i]); mypc(c); }
void writer(const char x[], char c) { int i; for (i = 0; x[i] != '\0'; i++)mypc(x[i]); mypc(c); }
template<class T> void writerLn(T x) { writer(x, '\n'); }
template<class T, class S> void writerLn(T x, S y) { writer(x, ' '); writer(y, '\n'); }
template<class T, class S, class U> void writerLn(T x, S y, U z) { writer(x, ' '); writer(y, ' '); writer(z, '\n'); }
template<class T, class S, class U, class V> void writerLn(T x, S y, U z, V v) { writer(x, ' '); writer(y, ' '); writer(z, ' '); writer(v, '\n'); }
template<class T> void writerArr(T x[], int n) { if (!n) { mypc('\n'); return; }FOR(i, n - 1)writer(x[i], ' '); writer(x[n - 1], '\n'); }
template<class T> void writerArr(vector<T>& x) { writerArr(x.data(), (int)x.size()); }

template<class T> void chmin(T& a, const T& b) { if (a > b) a = b; }
template<class T> void chmax(T& a, const T& b) { if (a < b) a = b; }

template<class T> T gcd(T a, T b) { return b ? gcd(b, a % b) : a; }
template<class T> T lcm(T a, T b) { return a / gcd(a, b) * b; }
ll mod_pow(ll a, ll n, ll mod) {
	ll ret = 1;
	ll p = a % mod;
	while (n) {
		if (n & 1) ret = ret * p % mod;
		p = p * p % mod;
		n >>= 1;
	}
	return ret;
}
template<class T> T extgcd(T a, T b, T& x, T& y) { for (T u = y = 1, v = x = 0; a;) { T q = b / a; swap(x -= q * u, u); swap(y -= q * v, v); swap(b -= q * a, a); } return b; }
ll mod_inv(ll a, ll m) { ll x, y; extgcd<ll>(a, m, x, y); return (m + x % m) % m; }

class UnionFind {
private:
	int n;
	vector<int> a;
public:
	UnionFind(int n) : n(n), a(n, -1) {}
	int find(int x) { return a[x] < 0 ? x : (a[x] = find(a[x])); }
	bool same(int x, int y) { return find(x) == find(y); }
	bool same(Pii& p) { return same(p.first, p.second); }
	bool unite(int x, int y) {
		x = find(x), y = find(y);
		if (x == y) return false;
		if (a[x] > a[y]) swap(x, y);
		a[x] += a[y];
		a[y] = x;
		n--;
		return true;
	}
	bool unite(Pii& p) { return unite(p.first, p.second); }
	int size() const { return n; }
	int size(int x) { return -a[find(x)]; }
};

const int MOD = ten(9) + 7;

int dep[1000], par[1000];
ll parlen[1000];
vector<pair<int,ll>> te[1000];

void build(int v, int par, int d) {
	dep[v] = d;
	::par[v] = par;
	for (auto& e : te[v]) {
		if (e.first == par) continue;
		parlen[e.first] = e.second;
		build(e.first, v, d + 1);
	}
}

ll maxlen(int u, int v) {
	ll ret = 0;
	while (u != v) {
		if (dep[u] > dep[v]) {
			swap(u, v);
		}
		int nv = par[v];
		chmax(ret, parlen[v]);
		v = nv;
	}

	return ret;
}

ll pow2(int n) {
	ll ret = 1;
	FOR(i, n) {
		ret = ret * 2 % MOD;
	}
	return ret;
}

ll solve(int n, ll x, vector<pair<ll, Pii>> e) {
	if (n <= 2) {
		return 0;
	}

	sort(e.begin(), e.end());
	vector<pair<ll, Pii>> rem;
	{
		UnionFind uf(n);
		FOR(i, sz(e)) {
			if (uf.unite(e[i].second)) {
				x -= e[i].first;
				te[e[i].second.first].emplace_back(e[i].second.second, e[i].first);
				te[e[i].second.second].emplace_back(e[i].second.first, e[i].first);
			} else {
				rem.emplace_back(e[i]);
			}
		}
	}

	ll ans = 0;
	if (x == 0) {
		ll add = (pow2(n - 2) - 1) * pow2(sz(e) - n + 1);
		ans = (ans + add) % MOD;
	}
	build(0, -1, 0);

	int eq = 0, lt = 0, gt = 0;
	FOR(i, sz(rem)) {
		ll w = rem[i].first;
		int u, v; tie(u, v) = rem[i].second;
		ll remlen = maxlen(u, v);
		ll nval = x + remlen - w;
		if (nval == 0) eq++;
		else if (nval < 0) lt++;
		else gt++;
	}
	{
		ll add = 0;
		add += pow2(lt) * (pow2(eq) - 1) % MOD;
		ans += add;
	}

	ans *= 2;
	ans %= MOD;

	return ans;
}


int main() {
	int n, m; reader(n, m);

	ll x; reader(x);
	vector<pair<ll, Pii>> e;
	FOR(i, m) {
		int u, v, w; reader(u, v, w);
		v--; u--;
		e.emplace_back(ll(w), Pii(u, v));
	}
	ll ans = solve(n, x, e);
	writerLn(ans);

	return 0;
}

Measured memory_bytes: 512