//isaf27

#include <iostream>
#include <cstdio>
#include <algorithm>
#include <cstring>
#include <ctime>
#include <vector>
#include <queue>
#include <bitset>
#include <cmath>
#include <time.h>
#include <set>
#include <map>
#include <unordered_set>
#include <unordered_map>
#include <stdlib.h>
#include <deque>
#include <iomanip>
#include <complex>
//#include <ext/rope>

using namespace std;
//using namespace __gnu_cxx;

//defines
typedef long long ll;
typedef long double ld;
#define TIME clock() * 1.0 / CLOCKS_PER_SEC
#define fast_read cin.sync_with_stdio(0)
#define PREX(number) cout << fixed << setprecision(number)
#define nul point(0, 0)
#define random srand(time(NULL))
#define rand_int abs((rand() << 15) | rand())
#define str_to_int(stroka) atoi(stroka.c_str())
#define str_to_ll(stroka) atoll(stroka.c_str())
#define str_to_double(stroka) atof(stroka.c_str())
#define what_is(x) cerr << #x << " is " << x << endl
#define solve_system int number; cin >> number; for (int i = 0; i < number; i++) solve()
#define solve_system_scanf int number; scanf("%d", &number); forn(i, 0, number) solve()

//easy functions
template< typename T >
T gcd(T a, T b) { return a ? gcd(b % a, a) : b; }
template< typename T >
T lcm(T a, T b) { return (a / gcd(a, b)) * b; }
bool is_down(char x) { return ('a' <= x && x <= 'z'); }
bool is_upper(char x) { return ('A' <= x && x <= 'Z'); }
bool is_digit(char x) { return ('0' <= x && x <= '9'); }

//constants
const ld pi = 3.141592653589793238462643383279;
const ld log23 = 1.58496250072115618145373894394781;
const ld eps = 1e-10;
const ld zero = 0;
const ll INF = 1e18 + 239;
const int COUT = 30;
const int prost = 239;
const ll prost64 = 239;
const int two = 2;
const int thr = 3;
const ll sr = 31;
const ll MOD = 1e9 + 7;
const ll MOD2 = MOD * MOD;
const int BIG = 1e9 + 239;
const int alf = 26;
const int M = 2 * 1e5 + 239;
const int N = 2 * 1e3 + 239;
const int T = (1 << 20);
const int B = trunc(sqrt(M)) + 1;
const int MAX_LOG = 19;
const int km = (1 << 18);
const int dx[4] = {-1, 0, 1, 0};
const int dy[4] = {0, 1, 0, -1};
const int dxo[8] = {-1, -1, -1, 0, 1, 1, 1, 0};
const int dyo[8] = {-1, 0, 1, 1, 1, 0, -1, -1};
const int bit_max = 32;
const int dig = 10;
const string str_alf = "abcdefghijklmnopqrstuvwxyz";
const string str_alf_big = "ABCDEFGHIJKLMNOPQRSTUVWXYZ";
const int day[12] = {31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31};
const int digarr[10] = {6, 2, 5, 5, 4, 5, 6, 3, 7, 6};
const int bt = 31;

// Code starts here

struct dsu
{
    vector<int> parent, r;

    dsu()
    {
        parent = r = {};
    }

    dsu(int n)
    {
        parent.resize(n);
        r.resize(n);
        for (int i = 0; i < n; i++)
            parent[i] = i, r[i] = 0;
    }

    int find_set(int a)
    {
        if (parent[a] == a)
            return a;
        return parent[a] = find_set(parent[a]);
    }

    void merge_set(int a, int b)
    {
        a = find_set(a);
        b = find_set(b);
	if (a == b)
		return;
        if (r[a] >= r[b])
            swap(a, b);
        parent[a] = b;
        if (r[a] == r[b])
            r[b]++;
    }

    bool is_connect(int a, int b)
    {
        return find_set(a) == find_set(b);
    }
};

int n, m;
ll x;
vector<tuple<ll, int, int> > rb;
bool ign[N];
vector<int> cool;

ll getmst()
{
    dsu u = dsu(n);
    int it = 0;
    ll ans = 0;
    int num = 0;
    for (int i : cool)
    {
        int s = get<1>(rb[i]);
        int f = get<2>(rb[i]);
        ll l = get<0>(rb[i]);
        ans += l;
        num++;
        u.merge_set(s, f);
    }
    for (tuple<ll, int, int> t : rb)
    {
        if (ign[it])
        {
            it++;
            continue;
        }
        it++;
        int s = get<1>(t);
        int f = get<2>(t);
        ll l = get<0>(t);
        if (u.is_connect(s, f)) continue;
        ans += l;
        num++;
        u.merge_set(s, f);
    }
    if (num != (n - 1)) return INF;
    return ans;
}

int main()
{   /*
    #ifndef ONLINE_JUDGE
    freopen("input.txt", "r", stdin);
    freopen("output.txt", "w", stdout);
    #endif /**/
    fast_read;
    cin >> n >> m >> x;
    for (int i = 0; i < m; i++)
    {
        int s, f;
        ll l;
        cin >> s >> f >> l;
        s--, f--;
        rb.push_back(make_tuple(l, s, f));
    }
    sort(rb.begin(), rb.end());
    ll w = getmst();
    if (w > x)
    {
        cout << "0";
        return 0;
    }
    if (w == x)
    {
        int kol = 0;
        for (int i = 0; i < m; i++)
        {
            cool = {i};
            if (getmst() == x) kol++;
        }
        ll ans = 1;
        for (int i = 0; i < kol; i++)
            ans = (ans + ans) % MOD;
        ans = (ans + MOD - 2) % MOD;
        for (int i = 0; i < m - kol; i++)
            ans = (ans + ans) % MOD;
        cout << ans;
        return 0;
    }
    int kol = 0;
    int tl = 0;
    for (int i = 0; i < m; i++)
    {
        cool = {i};
        ll now = getmst();
        if (now == x)
            kol++;
        else if (now > x)
            tl++;
    }
    ll ans = 1;
    for (int i = 0; i < kol; i++)
        ans = (ans + ans) % MOD;
    ans = (ans + MOD - 1) % MOD;
    for (int i = 0; i < tl + 1; i++)
        ans = (ans + ans) % MOD;
    cout << ans;
    return 0;
}


Measured memory_bytes: 384