#include <bits/stdc++.h>

using namespace std;
typedef long long int ll;
typedef unsigned int uint;
typedef unsigned char uchar;
typedef unsigned long long ull;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<int> vi;

#define REP(i, x) for(int i=0;i<(int)(x);i++)
#define REPS(i, x) for(int i=1;i<=(int)(x);i++)
#define RREP(i, x) for(int i=((int)(x)-1);i>=0;i--)
#define RREPS(i, x) for(int i=((int)(x));i>0;i--)
#define FOR(i, c) for(__typeof((c).begin())i=(c).begin();i!=(c).end();i++)
#define RFOR(i, c) for(__typeof((c).rbegin())i=(c).rbegin();i!=(c).rend();i++)
#define ALL(container) (container).begin(), (container).end()
#define RALL(container) (container).rbegin(), (container).rend()
#define SZ(container) ((int)container.size())
#define mp(a, b) make_pair(a, b)
#define pb push_back
#define eb emplace_back
#define UNIQUE(v) v.erase( unique(v.begin(), v.end()), v.end() );
#define __builtin_popcount __builtin_popcountll

template<class T>
bool chmax(T &a, const T &b) {
    if (a < b) {
        a = b;
        return 1;
    }
    return 0;
}

template<class T>
bool chmin(T &a, const T &b) {
    if (a > b) {
        a = b;
        return 1;
    }
    return 0;
}

template<class T>
ostream &operator<<(ostream &os, const vector<T> &t) {
    os << "[";
    FOR(it, t) {
        if (it != t.begin()) os << ",";
        os << *it;
    }
    os << "]";
    return os;
}

template<class T>
ostream &operator<<(ostream &os, const set<T> &t) {
    os << "{";
    FOR(it, t) {
        if (it != t.begin()) os << ",";
        os << *it;
    }
    os << "}";
    return os;
}

template<class S, class T>
ostream &operator<<(ostream &os, const pair<S, T> &t) { return os << "(" << t.first << "," << t.second << ")"; }

template<class S, class T>
pair<S, T> operator+(const pair<S, T> &s, const pair<S, T> &t) {
    return pair<S, T>(s.first + t.first, s.second + t.second);
}

template<class S, class T>
pair<S, T> operator-(const pair<S, T> &s, const pair<S, T> &t) {
    return pair<S, T>(s.first - t.first, s.second - t.second);
}

const ll INF = 1ll << 60;
const double EPS = 1e-8;
const int MOD = 1000000007;

struct UnionFind {
    vector<int> d;

    UnionFind(int n = 0) : d(n, -1) {}

    bool unite(int x, int y) {
        if ((x = root(x)) != (y = root(y))) {
            if (d[y] < d[x]) swap(x, y);
            d[x] += d[y];
            d[y] = x;
        }
        return x != y;
    }

    bool find(int x, int y) { return root(x) == root(y); }

    int root(int x) { return d[x] < 0 ? x : d[x] = root(d[x]); }

    int size(int x = -1) { return x < 0 ? d.size() : -d[root(x)]; }
};


int T, n, m;
ll W;

ll MST(const vector<tuple<int, int, int>> &e, int t) {
    UnionFind uf(n);
    ll sum = 0;
    REP(i, e.size() + 1) {
        int w, u, v;
        tie(w, u, v) = e[i ? i - 1 : t];
        if (uf.unite(u, v)) sum += w;
    }
    return sum;
}

ll modpow(ll x, ll y) {
    ll r = 1, a = x % MOD;
    while (y > 0) {
        if ((y & 1) == 1) r = (r * a) % MOD;
        a = (a * a) % MOD;
        y /= 2;
    }
    return r;
}

ll solve() {
    cin >> n >> m >> W;
    vector<tuple<int, int, int>> e;
    REP(i, m) {
        int u, v, w;
        cin >> u >> v >> w;
        u--;
        v--;
        e.emplace_back(w, u, v);
    }
    sort(ALL(e));
    int p = 0, q = 0, r = 0;
    REP(i, m) {
        ll res = MST(e, i);
        if (res < W) p ++;
        if (res == W) q ++;
        if (res > W) r ++;
    }
    ll ans = 0;
    if (p == 0) {
        if (q < 2) return 0;
        return (modpow(2, q) - 2) * modpow(2, r);
    } else {
        return (modpow(2, q) - 1) * modpow(2, r) * 2;
    }
}

int main(int argc, char *argv[]) {
    ios::sync_with_stdio(false);
    cout << (solve() % MOD + MOD) % MOD << endl;
    return 0;
}

Measured memory_bytes: 256