/*
Author: QAQ Automaton
Lang: C++
Prog: zhuzhu.cpp
Mail: lk@qaq-am.com
Blog: https://www.qaq-am.com/
*/
#include<bits/stdc++.h>
#define debug(...) fprintf(stderr,__VA_ARGS__)
#define DEBUG printf("Passing [%s] in LINE %d\n",__FUNCTION__,__LINE__)
#define Debug debug("Passing [%s] in LINE %d\n",__FUNCTION__,__LINE__)
#define all(x) x.begin(),x.end()
#define x first
#define y second
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
const double eps=1e-8;
const double pi=acos(-1.0);
template<class T>int chkmin(T &a,T b){return a>b?a=b,1:0;}
template<class T>int chkmax(T &a,T b){return a<b?a=b,1:0;}
template<class T>T sqr(T a){return a*a;}
template<class T>T mmin(T a,T b){return a<b?a:b;}
template<class T>T mmax(T a,T b){return a>b?a:b;}
template<class T>T aabs(T a){return a<0?-a:a;}
template<class T>int dcmp(T a,T b){return a>b;}
template<int *a>int cmp_a(int x,int y){return a[x]<a[y];}
#define min mmin
#define max mmax
#define abs aabs
namespace io {
	const int SIZE = (1 << 21) + 1;
	char ibuf[SIZE], *iS, *iT, obuf[SIZE], *oS = obuf, *oT = oS + SIZE - 1, c, qu[55]; int f, qr;
	// getchar
	#define gc() (iS == iT ? (iT = (iS = ibuf) + fread (ibuf, 1, SIZE, stdin), (iS == iT ? EOF : *iS ++)) : *iS ++)
	// print the remaining part
	inline void flush () {
		fwrite (obuf, 1, oS - obuf, stdout);
		oS = obuf;
	}
	// putchar
	inline void putc (char x) {
		*oS ++ = x;
		if (oS == oT) flush ();
	}
	// input a signed integer
	inline bool read (signed &x) {
		for (f = 1, c = gc(); c < '0' || c > '9'; c = gc()) if (c == '-') f = -1;else if(c==EOF)return 0;
		for (x = 0; c <= '9' && c >= '0'; c = gc()) x = x * 10 + (c & 15); x *= f;
		return 1;
	}

	inline bool read (long long &x) {
		for (f = 1, c = gc(); c < '0' || c > '9'; c = gc()) if (c == '-') f = -1;else if(c==EOF)return 0;
		for (x = 0; c <= '9' && c >= '0'; c = gc()) x = x * 10 + (c & 15); x *= f;
		return 1;
	}
	inline bool read (char &x) {
		x=gc();
		return x!=EOF;
	}
	inline bool read(char *x){
		while((*x=gc())=='\n' || *x==' '||*x=='\r')if(*x==EOF)return 0;
		while(!(*x=='\n'||*x==' '||*x=='\r'||*x==EOF))*(++x)=gc();
		*x=0;
		return 1;
	}
	template<typename A,typename ...B>
	inline bool read(A &x,B &...y){
		return read(x)&&read(y...);
	}
	// print a signed integer
	inline bool write (signed x) {
		if (!x) putc ('0'); if (x < 0) putc ('-'), x = -x;
		while (x) qu[++ qr] = x % 10 + '0',  x /= 10;
		while (qr) putc (qu[qr --]);
		return 0;
	}

	inline bool write (long long x) {
		if (!x) putc ('0'); if (x < 0) putc ('-'), x = -x;
		while (x) qu[++ qr] = x % 10 + '0',  x /= 10;
		while (qr) putc (qu[qr --]);
		return 0;
	}
	inline bool write (char x) {
		putc(x);
		return 0;
	}
	inline bool write(const char *x){
		while(*x){putc(*x);++x;}
		return 0;
	}
	inline bool write(char *x){
		while(*x){putc(*x);++x;}
		return 0;
	}
	template<typename A,typename ...B>
	inline bool write(A x,B ...y){
		return write(x)||write(y...);
	}
	//no need to call flush at the end manually!
	struct Flusher_ {~Flusher_(){flush();}}io_flusher_;
}
using io :: read;
using io :: putc;
using io :: write;
int inf;
struct _init_{
    _init_(){
        memset(&inf,0x3f,sizeof(inf));
    }
};
_init_ ___INIT__;
struct Edge{
	int u,v;
	long long w;
};
Edge e[200005];
vector<int> to[200005];
int fa[18][200005];
int w[200005];
int f[200005];
int find(int x){return x==f[x]?x:f[x]=find(f[x]);}
bool cmp(Edge a,Edge b){return a.w<b.w;}
int dep[200005];
void dfs(int x){
	for(int i=1;i<=17;++i)fa[i][x]=fa[i-1][fa[i-1][x]];
	for(vector<int>::iterator i=to[x].begin();i!=to[x].end();++i){
		fa[0][*i]=x;
		dep[*i]=dep[x]+1;
		dfs(*i);
	}
}
int lca(int a,int b){
	if(dep[a]<dep[b])swap(a,b);
	for(int i=17;~i;--i)if(dep[a]-(1<<i)>=dep[b])a=fa[i][a];
	if(a==b)return a;
	for(int i=17;~i;--i)if(fa[i][a]!=fa[i][b]){
		a=fa[i][a];
		b=fa[i][b];
	}
	return fa[0][a];
}
const int p=1000000007;
int fpm(int a,int b){
	int c=1;
	for(;b;b>>=1,a=(ll)a*a%p)if(b&1)c=(ll)c*a%p;
	return c;
}
signed main(){
	int t,n,m;
	long long x;
	t=1;
	for(;t;--t){
		read(n,m,x);
		for(int i=1;i<=m;++i){
			read(e[i].u,e[i].v,e[i].w);
		}
		sort(e+1,e+m+1,cmp);
		for(int i=1;i<n+n;++i){to[i].clear();w[i]=0;f[i]=i;}
		int cnt=n;
		long long mn=0;
		for(int i=1;i<=m;++i)if(find(e[i].u)!=find(e[i].v)){
			int u=find(e[i].u),v=find(e[i].v);
			w[++cnt]=e[i].w;
			f[u]=cnt;f[v]=cnt;
			to[cnt].push_back(u);
			to[cnt].push_back(v);
			mn+=e[i].w;
		}
		if(mn>x){write("0\n");continue;}
		dfs(cnt);
		int a=0,b=0,c=0;
		for(int i=1;i<=m;++i){
			long long s=e[i].w-w[lca(e[i].u,e[i].v)]+mn;
			if(s<x)++a;
			else if(s==x)++b;
			else ++c;
		}
		if(a)write(2LL*fpm(2,c)%p*(fpm(2,b)-1)%p,'\n');
		else write(2LL*fpm(2,c)%p*(fpm(2,b-1)-1)%p,'\n');
	}
	return 0;
}

Measured memory_bytes: 24960