#include<bits/stdc++.h>
#define sqr(x) ((x)*(x))
#define ll long long
#define ull unsigned long long
#define ui unsigned int
#define ld long double
#define vi vector<int>
#define all(a) a.begin(),a.end()
#define HEAP(...) priority_queue<__VA_ARGS__ >
#define heap(...) priority_queue<__VA_ARGS__,vector<__VA_ARGS__ >,greater<__VA_ARGS__ > > 
#define pii pair<int,int> 
#define pb push_back
#define mp make_pair
#define debuge cerr<<"isok"<<endl
#define debug(x) cerr<<#x<<"="<<x<<endl
#define dprintf(...) fprintf(stderr,__VA_ARGS__)
#define SS second
#define FF first
#define ls (k<<1)
#define rs (k<<1|1)
#define clr(a,x) memset(a,x,sizeof(a))
#define cpy(a,x) memcpy(a,x,sizeof(a))
#define file(x) freopen(x".in","r",stdin),freopen(x".out","w",stdout)
#define SZ(x) ((int)x.size())
using namespace std;
template<class T> inline void gmin(T &x,const T &y){x=x>y?y:x;}
template<class T> inline void gmax(T &x,const T &y){x=x<y?y:x;}
template<class T> inline bool Gmin(T &x,const T &y){return x>y?x=y,1:0;}
template<class T> inline bool Gmax(T &x,const T &y){return x<y?x=y,1:0;}
const int BufferSize=1<<16;
char buffer[BufferSize],*Bufferhead,*Buffertail;
bool Terminal;
inline char Getchar(){
	if(Bufferhead==Buffertail){
		int l=fread(buffer,1,BufferSize,stdin);
		if(!l){Terminal=1;return 0;}
		Buffertail=(Bufferhead=buffer)+l;
	}
	return *Bufferhead++;
}
template<class T>inline bool read(T &x){
	x=0;char c=Getchar(),rev=0;
	while(c<'0'||c>'9'){rev|=c=='-';c=Getchar();if(Terminal)return 0;}
	while(c>='0'&&c<='9') x=x*10+c-'0',c=Getchar();
	if(c=='.'){
		c=Getchar();double t=0.1;
		while(c>='0'&&c<='9') x=x+(c-'0')*t,c=Getchar(),t=t/10;
	}
	x=rev?-x:x;
	return 1;
}
template<class T1,class T2> inline bool read(T1 &x,T2 &y){return read(x)&read(y);}
template<class T1,class T2,class T3> inline bool read(T1 &x,T2 &y,T3 &z){return read(x)&read(y)&read(z);}
template<class T1,class T2,class T3,class T4> inline bool read(T1 &x,T2 &y,T3 &z,T4 &w){return read(x)&read(y)&read(z)&read(w);}
inline bool reads(char *x){
	char c=Getchar();
	while(c<33||c>126){c=Getchar();if(Terminal)return 0;}
	while(c>=33&&c<=126) (*x++)=c,c=Getchar();
	*x=0;return 1;
}
template<class T>inline void print(T x,const char c='\n'){
	if(!x){putchar('0');putchar(c);return;}
	if(x<0) putchar('-'),x=-x;
	int m=0,a[20];
	while(x) a[m++]=x%10,x/=10;
	while(m--) putchar(a[m]+'0');
	putchar(c);
}
//--------------------------------head---------------------------------------------

const int inf=0x3f3f3f3f;
const int N=2005,M=100005,mod=1e9+7;
template<class T,class S> inline void ch(T &x,const S y){x=(x+y)%mod;}
inline int exp(int x,int y,const int mod=::mod){
	int ans=1;
	while(y){
		if(y&1) ans=(ll)ans*x%mod;
		x=(ll)x*x%mod;y>>=1;
	}return ans;
}

struct node{int u,v,w,tag;}p[N];
int n,m,fa[N],dep[N],f[N][11],val[N][11];
vector<pii> g[N];
ll X;

inline int find(int x){return fa[x]=fa[x]^x?find(fa[x]):x;}
inline void dfs(int x,int F=0){
	for(auto i:g[x]){
		int y=i.FF;
		if(y==F) continue;
		dep[y]=dep[x]+1;f[y][0]=x;
		val[y][0]=i.SS;dfs(y,x);
	}
}
inline int get(int x,int y){
	int ans=0;
	if(dep[x]>dep[y]) swap(x,y);
	for(int i=0,t=dep[y]-dep[x];i<10;i++)
		if(t&(1<<i)) gmax(ans,val[y][i]),y=f[y][i];
	if(x==y) return ans;
	for(int i=9;~i;i--)
		if(f[x][i]^f[y][i]) gmax(ans,max(val[x][i],val[y][i])),x=f[x][i],y=f[y][i];
	return max(ans,max(val[x][0],val[y][0]));
}
int main(){
#ifdef rqgao2014
	assert(freopen("input.txt","r",stdin));
#endif
	scanf("%d%d",&n,&m);
	scanf("%lld",&X);
	for(int i=1;i<=n;i++)
		fa[i]=i;
	for(int i=1;i<=m;i++)
		scanf("%d%d%d",&p[i].u,&p[i].v,&p[i].w);
	sort(p+1,p+m+1,[&](node a,node b){return a.w<b.w;});
	for(int i=1;i<=m;i++){
		int u=p[i].u,v=p[i].v,w=p[i].w;
		if(find(u)!=find(v)) fa[find(u)]=find(v),X-=w,g[u].pb(mp(v,w)),g[v].pb(mp(u,w)); else p[i].tag=1;
	}
	dfs(1);
	for(int j=1;j<10;j++)
		for(int i=1;i<=n;i++)
			f[i][j]=f[f[i][j-1]][j-1],val[i][j]=max(val[i][j-1],val[f[i][j-1]][j-1]);
	int c0=0,c1=0;
	for(int i=1;i<=m;i++){
//		dprintf("%d %d %d\n",p[i].u,p[i].v,p[i].w-get(p[i].u,p[i].v));
		if(p[i].w-get(p[i].u,p[i].v)<=X) c1++;
		if(p[i].w-get(p[i].u,p[i].v)<X) c0++;
	}
//	debug(c1);
//	debug(c0);
	print(((c1?(ll)exp(2,m-c1)*(exp(2,c1)-2):0)-(c0?(ll)exp(2,m-c0)*(exp(2,c0)-2)%mod:0)+mod)%mod);
	
	return 0;
}

Measured memory_bytes: 512