#include <iostream>
#include <string>
#include <cmath>
#include<algorithm>
#include<stack>
#include<queue>
#include<map>
#include<set>
#include<iomanip>
#define _USE_MATH_DEFINES
#include <math.h>
#include <functional>
#include<complex>
using namespace std;

#define rep(i,x) for(ll i=0;i<x;i++)
#define repn(i,x) for(ll i=1;i<=x;i++)

typedef long long ll;
const ll INF = 1e17;
const ll MOD = 1000000007;
const ll MAX = 4000001;
const double eps = 1E-18;

ll max(ll a, ll b) {
	if (a > b) { return a; }
	return b;
}

ll min(ll a, ll b) {
	if (a > b) { return b; }
	return a;
}

ll gcd(ll a, ll b) {
	if (b == 0) { return a; }
	if (a < b) { return gcd(b, a); }
	return gcd(b, a % b);
}

ll lcm(ll a, ll b) {
	return a / gcd(a, b) * b;
}

struct edge {
	ll ind;
	ll fr;
	ll to;
	ll d;
};

class mint {
	long long x;
public:
	mint(long long x = 0) : x((x% MOD + MOD) % MOD) {}
	mint operator-() const {
		return mint(-x);
	}
	mint& operator+=(const mint& a) {
		if ((x += a.x) >= MOD) x -= MOD;
		return *this;
	}
	mint& operator-=(const mint& a) {
		if ((x += MOD - a.x) >= MOD) x -= MOD;
		return *this;
	}
	mint& operator*=(const  mint& a) {
		(x *= a.x) %= MOD;
		return *this;
	}
	mint operator+(const mint& a) const {
		mint res(*this);
		return res += a;
	}
	mint operator-(const mint& a) const {
		mint res(*this);
		return res -= a;
	}
	mint operator*(const mint& a) const {
		mint res(*this);
		return res *= a;
	}

	mint operator^(const ll& t)const {
		if (!t) return 1;
		mint a = pow(t >> 1);
		a *= a;
		if (t & 1) a *= *this;
		return a;
	}

	mint pow(ll t) const {
		if (!t) return 1;
		mint a = pow(t >> 1);
		a *= a;
		if (t & 1) a *= *this;
		return a;
	}
	// for prime MOD
	mint inv() const {
		return pow(MOD - 2);
	}
	mint& operator/=(const mint& a) {
		return (*this) *= a.inv();
	}
	mint operator/(const mint& a) const {
		mint res(*this);
		return res /= a;
	}

	friend ostream& operator<<(ostream& os, const mint& m) {
		os << m.x;
		return os;
	}
};

///////////////////////////
struct unionfind {
	ll N;
	vector<ll> par;
	vector<ll> sz;//根の場合、その木のサイズ

	unionfind(ll N0) {
		N = N0;
		par.assign(N + 1, -1);
		sz.assign(N + 1, 1);

	}

	ll root(ll x) {
		if (par[x] == -1) { return x; }
		par[x] = root(par[x]);
		return par[x];
	}

	bool same(ll x, ll y) {
		return root(x) == root(y);
	}

	void unite(ll x, ll y) {
		ll a = root(x);
		ll b = root(y);
		if (a != b) {
			par[a] = b; sz[b] += sz[a];
		}

	}

	ll size(ll x) {
		ll r = root(x);
		return sz[r];
	}
};

struct Kruskal {
	ll N;
	vector<edge> e;
	vector<vector<edge>> g;
	ll dis;



	Kruskal(ll N0, vector<edge> e0) {
		N = N0;
		e = e0;

		g.resize(N + 1);

		unionfind uf(N);

		sort(e.begin(), e.end(), [](edge x, edge y) {return x.d < y.d; });

		dis = 0;

		rep(i, e.size()) {
			ll a = e[i].fr;
			ll b = e[i].to;
			if (uf.same(a, b)) { continue; }
			g[a].push_back({ e[i].ind,a,b,e[i].d });
			g[b].push_back({ e[i].ind,b,a,e[i].d });
			dis += e[i].d;
			uf.unite(a, b);
		}

	}


};


int main() {
	ll N, M, X;
	cin >> N >> M >> X;

	vector<edge> e(M);
	rep(i, M) {
		cin >> e[i].fr >> e[i].to >> e[i].d;
		e[i].ind = i;
	}

	sort(e.begin(), e.end(), [](edge x, edge y) {return x.d < y.d; });

	vector<ll> lst(M);

	for(ll i=1; i<M; i++) {
		vector<edge> ei(M);
		rep(j, M) ei[j] = e[j];
		ei[i].d = 0;

		Kruskal kr(N, ei);
		lst[i] = kr.dis + e[i].d;

	}

	
	mint x = 1;
	mint y = 1;
	for(ll i=1; i<M; i++) {
		if (lst[i] > X) { x *= 2; }
		if (lst[i] >= X) { y *= 2; }
	}

	mint ans = (y - x) * 2;

	cout << ans << endl;


	system("PAUSE");
}


Measured memory_bytes: 756