#include <bits/stdc++.h>
#define ll long long
#define INF 1000000005
#define MOD 1000000007
#define EPS 1e-10
#define rep(i,n) for(int i=0;i<(int)(n);++i)
#define rrep(i,n) for(int i=(int)(n)-1;i>=0;--i)
#define srep(i,s,t) for(int i=(int)(s);i<(int)(t);++i)
#define each(a,b) for(auto& (a): (b))
#define all(v) (v).begin(),(v).end()
#define len(v) (int)(v).size()
#define zip(v) sort(all(v)),v.erase(unique(all(v)),v.end())
#define cmx(x,y) x=max(x,y)
#define cmn(x,y) x=min(x,y)
#define fi first
#define se second
#define pb push_back
#define show(x) cout<<#x<<" = "<<(x)<<endl
#define spair(p) cout<<#p<<": "<<p.fi<<" "<<p.se<<endl
#define sar(a,n) cout<<#a<<":";rep(pachico,n)cout<<" "<<a[pachico];cout<<endl
#define svec(v) cout<<#v<<":";rep(pachico,v.size())cout<<" "<<v[pachico];cout<<endl
#define svecp(v) cout<<#v<<":";each(pachico,v)cout<<" {"<<pachico.first<<":"<<pachico.second<<"}";cout<<endl
#define sset(s) cout<<#s<<":";each(pachico,s)cout<<" "<<pachico;cout<<endl
#define smap(m) cout<<#m<<":";each(pachico,m)cout<<" {"<<pachico.first<<":"<<pachico.second<<"}";cout<<endl

using namespace std;

typedef pair<int,int> P;
typedef pair<ll,ll> pll;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef vector<double> vd;
typedef vector<P> vp;
typedef vector<string> vs;

const int MAX_N = 100005;

int n, m;
ll X;

inline int mod_pow(int a, ll b)
{
    int res = 1;
    while(b){
        if(b & 1){
            res = (ll)res * a % MOD;
        }
        a = (ll)a * a % MOD;
        b >>= 1;
    }
    return res;
}

inline int add(int x,int y)
{
    return (x + y)%MOD;
}

inline int sub(int x,int y)
{
    return (x+MOD-y)%MOD;
}

inline int mul(int x,int y)
{
    return (ll)x*y%MOD;
}


class UF {
private:
    int sz; vector<int> par,nrank;
public:
    UF(){}
    UF(int node_size){ sz = node_size; par.resize(sz),nrank.resize(sz); rep(i,sz){ par[i] = i; nrank[i] = 0; } }
    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(nrank[x] < nrank[y]){ par[x] = y; }else{ par[y] = x; if(nrank[x] == nrank[y]) nrank[x]++; } }
    bool same(int x,int y){ return find(x) == find(y); }
};

class Kruskal{
public:
	struct edge{
		int u,v;
		int cost;
		bool operator<(const edge& another) const {
			return cost < another.cost;
		}
	};
    struct eda{
		int to, cost;
	};
    int V;
    vector<vector<eda> > G;
    vector<edge> es;
    map<int,int> mp;
    Kruskal(int node_size) : V(node_size), G(V){}
	void add_edge(int u,int v,int cost){
		es.push_back((edge){u,v,cost});
	}
    bool dfs(int u, int p, int t, vector<int>& route){
        if(u == t) return true;
        each(e,G[u]){
            if(e.to != p){
                route.pb(e.cost);
                if(dfs(e.to, u, t, route)) return true;
                route.pop_back();
            }
        }
        return false;
    }
	int solve(){
		UF uf(V);
		ll res = 0;
		int cnt = 0;
        sort(es.begin(),es.end());
        int ad = 0;
		for(auto& e : es){
			if(!uf.same(e.u,e.v)){
                G[e.u].pb((eda){e.v, e.cost}), G[e.v].pb((eda){e.u, e.cost});
				uf.unite(e.u,e.v);
				res += e.cost;
				cnt++;
			}else{
                vector<int> route;
                dfs(e.u, -1, e.v, route);
                int mx = -1, mxsize = 0;
                each(val, route){
                    if(mx < val){
                        mx = val;
                        mxsize = 1;
                    }else if(mx == val){
                        mxsize++;
                    }
                }
                if(e.cost == mx){
                    ad++;
                }else{
                    mp[e.cost-mx]++;
                }
            }
		}
        if(res == X){
            int al = n-1+ad;
            return mul(mod_pow(2,m-al),sub(mod_pow(2,al),2));
        }else{
            if(X - res > INF || mp[X-res] == 0) return 0;
            int k;
            int sm = 0;
            each(val,mp){
                if(val.fi == X-res){
                    k = val.se;
                    break;
                }else{
                    sm += val.se;
                }
            }
            return mul(sub(mod_pow(2,k+1),2),mod_pow(2,m-(n-1+ad+k+sm)));
        }
	}
};

int main()
{
    cin.tie(0);
    ios::sync_with_stdio(false);
    cin >> n >> m;
    cin >> X;
    Kruskal kr(n);
    rep(i,m){
        int a,b,c;
        cin >> a >> b >> c;
        kr.add_edge(a-1, b-1, c);
    }
    cout << kr.solve() << "\n";
    return 0;
}


Measured memory_bytes: 384