#pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx")
#pragma GCC optimize("unroll-loops")
//#pragma warning(disable : 4996)

#ifdef _MSC_VER
#include <intrin.h>
#define __builtin_popcount __popcnt
#define __builtin_popcountll __popcnt64
#endif

#include <limits.h>
#include <math.h>
#include <time.h>

#include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <complex>
#include <cstdio>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>

using namespace std;

#define REP(i, n) for (int i = 0; i < (n); ++i)
#define REPR(i, n) for (int i = n - 1; i >= 0; --i)
#define FOR(i, m, n) for (int i = m; i < n; ++i)
#define FORR(i, m, n) for (int i = m - 1; i >= n; --i)
#define SORT(v, n) sort(v, v + n);
#define VSORT(v) sort(v.begin(), v.end());
#define REVERSE(v, n) reverse(v, v + n);
#define VREVERSE(v) reverse(v.begin(), v.end())
#define ll long long
#define print(x) cout << (x) << '\n'
#define pe(x) cout << (x) << " "
#define DEBUG(x) cout << #x << ": " << x << endl
#define lb(v, n) lower_bound(v.begin(), v.end(), (n))
#define ub(v, n) upper_bound(v.begin(), v.end(), (n))
#define int long long
//#define double long double
#define all(x) (x).begin(), (x).end()
#define print_space(v) REP(i, v.size()) cout << v[i] << ((i == v.size() - 1) ? "\n" : " ")
template <typename T1, typename T2> inline void chmin(T1& a, T2 b) {if (a > b) a = b;}
template <typename T1, typename T2> inline void chmax(T1& a, T2 b) {if (a < b) a = b;}
typedef pair<int, int> pii;
typedef pair<long long, long long> pll;
std::random_device rd;
std::mt19937 mt(rd());
constexpr ll MOD = 1e9 + 7;
constexpr int MAX = 500050;
const double pi = acos(-1);
constexpr double EPS = 1e-8;
constexpr ll LINF = 1e18 + 1;
constexpr int INF = 1e9 + 1;
// const int dx[4] = { 0,0,-1,1 }, dy[4] = { 1,-1,0,0 };

struct UnionFind {
	int N;
	vector<int> siz;
	vector<int> par;
	vector<int> Rank;
	UnionFind(int n) : siz(n, 1), par(n), Rank(n, 0) {
		N = n;
		for (int i = 0; i < N; i++) par[i] = i;
	}
	int find(int x) {
		if (par[x] == x) {
			return x;
		}
		else {
			return par[x] = find(par[x]);
		}
	}
	void unite(int x, int y) {
		x = find(x);
		y = find(y);
		if (x == y) return;
		if (Rank[x] < Rank[y]) {
			par[x] = y;
			siz[x] += siz[y];
			siz[y] = siz[x];
		}
		else {
			siz[y] += siz[x];
			siz[x] = siz[y];
			par[y] = x;
			if (Rank[x] == Rank[y]) Rank[x]++;
		}
	}
	bool same(int x, int y) { return find(x) == find(y); }
};

const int mod = 1000000007;
//const int mod = 998244353;
struct mint {
	ll x; // typedef long long ll;
	mint(ll 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 { return mint(*this) += a; }
	mint operator-(const mint a) const { return mint(*this) -= a; }
	mint operator*(const mint a) const { return mint(*this) *= 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 { return mint(*this) /= a; }
};
istream& operator>>(istream& is, const mint& a) { return is >> a.x; }
ostream& operator<<(ostream& os, const mint& a) { return os << a.x; }

struct Edge {
	int from, to, cost;
};
vector<Edge>es;
vector<Edge>G[1010];
int weight[2020];
void solve() {
	int N, M; cin >> N >> M;
	int X; cin >> X;
	REP(i, M) {
		int u, v, w; cin >> u >> v >> w;
		u--, v--;
		G[u].push_back({ u,v,w });
		G[v].push_back({ v,u,w });
		es.push_back({ u,v,w });
	}
	//各辺について、その辺を使用したときのMSTの重みを調べる
	REP(i, M) {
		UnionFind uf(N);
		uf.unite(es[i].from, es[i].to);
		int res = es[i].cost;
		vector<Edge>ess = es;
		sort(all(ess), [](const Edge &a,const Edge &b)->bool{
			if(a.cost!=b.cost)return a.cost < b.cost;
			else if (a.from != b.from)return a.from < b.from;
			else return a.to < b.to;
		});
		REP(j, M) {
			if (!uf.same(ess[j].from, ess[j].to)) {
				uf.unite(ess[j].from, ess[j].to);
				res += ess[j].cost;
			}
		}
		weight[i] = res;
	}
	map<int, int>mp;
	REP(i, M) {
		mp[weight[i]]++;
	}
	vector<int>ws, cs;
	for (auto p : mp) {
		ws.push_back(p.first);
		cs.push_back(p.second);
	}
	if (find(all(ws), X) == ws.end()) {
		print(0); return;
	}
	else {
		auto itr = find(all(ws), X);
		mint a = 0, b = 0;
		mint tw = 2;
		if (itr == ws.begin()) {
			a = ((mint)2).pow(M);
		}
		else {
			int id = itr - ws.begin();
			a = 1;
			a *= 2;
			FOR(i, id, ws.size()) {
				a *= tw.pow(cs[i]);
			}
		}
		int id = itr - ws.begin(); id++;
		b = 2;
		FOR(i, id, ws.size())b *= tw.pow(cs[i]);
		print(a - b);
	}

}

signed main() {
	cin.tie(0);
	ios::sync_with_stdio(false);
	// mt.seed((int)(time(0)));
	// int q;
	// cin >> q;
	// while (q--)
	solve();
}


Measured memory_bytes: 3972