//start of jonathanirvings' template v3.0.3 (BETA)

#include <bits/stdc++.h>
using namespace std;

typedef long long LL;
typedef pair<int,int> pii;
typedef pair<LL,LL> pll;
typedef pair<string,string> pss;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<pii> vii;
typedef vector<LL> vl;
typedef vector<vl> vvl;

double EPS = 1e-9;
int INF = 1000000005;
long long INFF = 1000000000000000005LL;
double PI = acos(-1);
int dirx[8] = {-1,0,0,1,-1,-1,1,1};
int diry[8] = {0,1,-1,0,-1,1,-1,1};

#ifdef TESTING
  #define DEBUG fprintf(stderr,"====TESTING====\n")
  #define VALUE(x) cerr << "The value of " << #x << " is " << x << endl
  #define debug(...) fprintf(stderr, __VA_ARGS__)
#else
  #define DEBUG 
  #define VALUE(x)
  #define debug(...)
#endif

#define FOR(a,b,c) for (int (a)=(b);(a)<(c);++(a))
#define FORN(a,b,c) for (int (a)=(b);(a)<=(c);++(a))
#define FORD(a,b,c) for (int (a)=(b);(a)>=(c);--(a))
#define FORSQ(a,b,c) for (int (a)=(b);(a)*(a)<=(c);++(a))
#define FORC(a,b,c) for (char (a)=(b);(a)<=(c);++(a))
#define FOREACH(a,b) for (auto &(a) : (b))
#define REP(i,n) FOR(i,0,n)
#define REPN(i,n) FORN(i,1,n)
#define MAX(a,b) a = max(a,b)
#define MIN(a,b) a = min(a,b)
#define SQR(x) ((LL)(x) * (x))
#define RESET(a,b) memset(a,b,sizeof(a))
#define fi first
#define se second
#define mp make_pair
#define pb push_back
#define ALL(v) v.begin(),v.end()
#define ALLA(arr,sz) arr,arr+sz
#define SIZE(v) (int)v.size()
#define SORT(v) sort(ALL(v))
#define REVERSE(v) reverse(ALL(v))
#define SORTA(arr,sz) sort(ALLA(arr,sz))
#define REVERSEA(arr,sz) reverse(ALLA(arr,sz))
#define PERMUTE next_permutation
#define TC(t) while(t--)

inline string IntToString(LL a){
  char x[100];
  sprintf(x,"%lld",a); string s = x;
  return s;
}

inline LL StringToInt(string a){
  char x[100]; LL res;
  strcpy(x,a.c_str()); sscanf(x,"%lld",&res);
  return res;
}

inline string GetString(void){
  char x[1000005];
  scanf("%s",x); string s = x;
  return s;
}

inline string uppercase(string s){
  int n = SIZE(s); 
  REP(i,n) if (s[i] >= 'a' && s[i] <= 'z') s[i] = s[i] - 'a' + 'A';
  return s;
}

inline string lowercase(string s){
  int n = SIZE(s); 
  REP(i,n) if (s[i] >= 'A' && s[i] <= 'Z') s[i] = s[i] - 'A' + 'a';
  return s;
}

inline void OPEN (string s) {
  #ifndef TESTING
  freopen ((s + ".in").c_str (), "r", stdin);
  freopen ((s + ".out").c_str (), "w", stdout);
  #endif
}

//end of jonathanirvings' template v3.0.3 (BETA)

int MOD = 1e9 + 7;
int n,m;
pair<int,pii> edge[2005];
int parent[1005];
vii adj[1005];
LL dua[2005];
LL x;
map<int,vector<pii>> edges;

LL normalize(LL x)
{
  x %= MOD;
  if (x < 0) x += MOD;
  return x;
}

int pt(int x)
{
  if (x == parent[x]) return x;
  return parent[x] = pt(parent[x]);
}

int cari(int now, int target, int pt, int sofar)
{
  if (now == target) return sofar;
  REP(i,SIZE(adj[now]))
  {
    if (adj[now][i].fi == pt) continue;
    int ret = cari(adj[now][i].fi,target,now,max(sofar,adj[now][i].se));
    if (ret != -1) return ret;
  }
  return -1;
}

int main()
{
  scanf("%d %d",&n,&m);
  dua[0] = 1;
  FORN(i,1,m+3) dua[i] = (dua[i-1] * 2) % MOD;
  REPN(i,n) parent[i] = i;
  scanf("%lld",&x);
  REP(i,m)
  {
    scanf("%d %d %d",&edge[i].se.fi,&edge[i].se.se,&edge[i].fi);
    edges[edge[i].fi].pb(edge[i].se);
  }
  SORTA(edge,m);
  LL now = 0;
  REP(i,m)
  {
    int u = edge[i].se.fi;
    int v = edge[i].se.se;
    u = pt(u); v = pt(v);
    if (u != v)
    {
      now += edge[i].fi;
      parent[u] = v;
      adj[edge[i].se.fi].pb(mp(edge[i].se.se,edge[i].fi));
      adj[edge[i].se.se].pb(mp(edge[i].se.fi,edge[i].fi));
      // debug("%d %d\n",edge[i].se.fi,edge[i].se.se);
    }
  }
  if (x < now)
  {
    puts("0");
    return 0;
  }
  if (now < x)
  {
    int bebas = 0;
    int ok = 0;
    REP(i,m)
    {
      int u = edge[i].se.fi;
      int v = edge[i].se.se;
      int k = cari(u,v,-1,0);
      if (now + edge[i].fi - k == x)
      {
        ++ok;
      } else if (now + edge[i].fi - k > x)
      {
        ++bebas;
      }
    }
    LL risan = normalize(dua[ok] - 1);
    risan = normalize(risan * dua[bebas + 1]);
    printf("%lld\n",risan);
  } else 
  {
    // assert(false);
    REPN(i,n) parent[i] = i;
    int bisa = 0;
    for (pair<int,vector<pii>> tmp : edges)
    {
      // debug("%d\n",tmp.fi);
      vector<pii> e = tmp.se;
      for (pii ee : e)
      {
        int u = ee.fi;
        int v = ee.se;
        u = pt(u); v = pt(v);
        if (u != v)
        {
          ++bisa;
        }
      }
      for (pii ee : e)
      {
        int u = ee.fi;
        int v = ee.se;
        u = pt(u); v = pt(v);
        if (u != v)
        {
          parent[u] = v;
        }
      }
    }
    // VALUE(bisa);
    LL risan = normalize(dua[bisa] - 2);
    // VALUE(risan);
    risan = normalize(risan * dua[m - bisa]);
    // VALUE(risan);
    printf("%lld\n",risan);
  }
  return 0;
}











Measured memory_bytes: 640