// **** WHEN THE GOING GETS TOUGH, THE TOUGH GETS GOING. ****

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
using namespace std;
#define ll long long int
#define ull unsigned long long int
#define ld long double
#define ordered_set tree < ll ,  null_type ,  less<ll> ,  rb_tree_tag ,  tree_order_statistics_node_update >
//added two more functions to set
//(1)*(set.find_by_order(k))[kth element in the sorted set] 
//(2)set.order_of_key(k)[count of elements strictly less than k]

typedef vector< int > vi;
typedef vector< ll > lvi;
typedef vector< vi > vvi;
typedef vector< lvi > lvvi;
typedef pair< int,int > ii;
typedef pair< ll,ll > lii;
typedef vector<ii> vii;
typedef vector<lii> lvii;

#define min_prq(t) priority_queue<t,vector<t>,greater<t>>
#define max_prq(t) priority_queue<t>
#define pb push_back
#define all(c) (c).begin(),(c).end()
#define tr(c,i) for(auto i = (c).begin(); i != (c).end(); i++)//remember i is an iterator
#define present(c,x) ((c).find(x) != (c).end())//for sets,maps,multimaps
#define cpresent(c,x) (find(all(c),x) != (c).end())//for vectors
#define tc(t) int (t); cin>>(t);while((t)--)
#define ff first
#define ss second
#define error(args...) { string _s = #args; replace(_s.begin(), _s.end(), ',', ' '); stringstream _ss(_s); istream_iterator<string> _it(_ss); err(_it, args); }
void err(istream_iterator<string> it) {}
template<typename T, typename... Args>
void err(istream_iterator<string> it, T a, Args... args) {
	cerr << *it << " is " << a << endl;
	err(++it, args...);
}

//-----------------------------------------------------------------------------------------------------------------------------------------------------------------
#define mod 1000000007
//-----------------------------------------------------------------------------------------------------------------------------------------------------------------

ll mod_sum() { return 0LL; }
template<typename T, typename... Args>
T mod_sum(T a, Args... args) { return ((a + mod_sum(args...))%mod + mod)%mod; }

ll mod_product() { return 1LL; }
template<typename T, typename... Args>
T mod_product(T a, Args... args) { return (a*mod_product(args...))%mod; }
//-----------------------------------------------------------------------------------------------------------------------------------------------------------------

class dsu
{
	lvi parent,size;
public:
	dsu(ll n)
	{
		parent.assign(n+2,-1);
		size.assign(n+2,0);
	}
	ll getparent(ll x)
	{
		if(parent[x]==-1) return x;
		else return parent[x]=getparent(parent[x]);
	}
	bool issameset(ll x,ll y) { return getparent(x)==getparent(y);}
	void unionset(ll x,ll y)
	{
		x=getparent(x);
		y=getparent(y);
		if(size[y]>size[x]) swap(x,y);
		size[x]+=size[y];
		parent[y]=x;
	}
};

ll n,m,x;
vector<pair<lii,ll>> edges;


ll mst(ll x)
{
	dsu ds(n);
	ll ans=edges[x].ss;
	ds.unionset(edges[x].ff.ff,edges[x].ff.ss);
	for(int i=0;i<m;i++)
	{
		ll a=edges[i].ff.ff,b=edges[i].ff.ss;

		if(ds.issameset(a,b)) continue;
		ds.unionset(a,b);
		ans+=edges[i].ss;
	}
	return ans;
}

bool mysort(pair<lii,ll> a,pair<lii,ll> b)
{
	return a.ss<b.ss;
}
ll modpow(ll x,ll y)
{
	ll ans=1;
	while(y>0)
	{
		if(y&1) ans=(ans*x)%mod;
		x=(x*x)%mod;
		y=y>>1;
	}
	return ans;
}
signed main()
{
	ios_base::sync_with_stdio(false);
    cin.tie(NULL);	
	cin>>n>>m>>x;
	edges.resize(m);
	for(int i=0;i<m;i++)
	{
		cin>>edges[i].ff.ff>>edges[i].ff.ss>>edges[i].ss;
	}
	sort(all(edges),mysort);
	ll a=0,b=0,c=0;
	for(int i=0;i<m;i++)
	{
		ll val1=mst(i);
		if(val1<x) a++;
		else if(val1==x) b++;
		else c++; 
	}
	ll ans=1;
	if(b==0) ans=0;
	else if(a==0)
	{
		ans=mod_product(modpow(2,c),mod_sum(modpow(2,b),-2));
	}
	else ans=mod_product(modpow(2,c),2,mod_sum(modpow(2,b),-1));
	cout<<ans<<endl;
	return 0;
}

Measured memory_bytes: 384