#include <bits/stdc++.h>
using namespace std;
#define int long long
#define stoi stoll
using ll=long long;
using vi=vector<int>;
using pii=pair<int,int>;
#define ALL(c) begin(c),end(c)
#define RALL(c) rbegin(c),rend(c)
#define ITR(i,b,e) for(auto i=(b);i!=(e);++i)
#define FORE(x,c) for(auto &x:c)
#define REPF(i,a,n) for(int i=a,i##len=(int)(n);i<i##len;++i)
#define REP(i,n) REPF(i,0,n)
#define REPR(i,n) for(int i=(int)(n);i>=0;--i)
#define SZ(c) ((int)c.size())
#define CONTAIN(c,x) (c.find(x)!=end(c))
#define OUTOFRANGE(y,x,h,w) ((y)<0||(x)<0||(y)>=(h)||(x)>=(w))
#define dump(...)
const signed INF_=1001001001; const long long INF=1001001001001001001LL;
const int DX[9]={0,1,0,-1,1,1,-1,-1,0},DY[9]={-1,0,1,0,-1,1,1,-1,0};
template<class T> ostream& operator<<(ostream &os,const vector<T> &v) {
    ITR(i,begin(v),end(v))os<<*i<<(i==end(v)-1?"":" ");return os;}
template<class T> istream& operator>>(istream &is,vector<T> &v) {
    ITR(i,begin(v),end(v)) is>>*i;return is;}
template<class T,class U> istream& operator>>(istream &is, pair<T,U> &p) {
    is>>p.first>>p.second;return is;}
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> using heap=priority_queue<T,vector<T>,greater<T>>;
struct{template<class T> operator T(){T x;cin>>x;return x;}} IN;
struct before_main_function {
    before_main_function() {
        cin.tie(0);ios::sync_with_stdio(false);
        cout<<setprecision(15)<<fixed;
        #define endl "\n"
    }
} before_main_function;
//------------------8<------------------------------------8<--------------------

struct union_find {
    vector<int> data;
    union_find(int size) : data(size, -1) {}
    void unite(int x, int y) {
        x = root(x); y = root(y);
        if(x != y) {
            if(data[y] < data[x]) swap(x, y);
            data[x] += data[y];
            data[y] = x;
        }
    }
    bool same(int x, int y) {
        return root(x) == root(y);
    }
    int root(int x) {
        return data[x] < 0 ? x : (data[x] = root(data[x]));
    }
    int size(int x) {
        return -data[root(x)];
    }
};

const int MOD = 1e9 + 7;
int bin_pow_mod(int a, int b) {
    int ret = 1;
    while (b > 0) {
        if (b & 1) ret = (ret * a) % MOD;
        a = (a * a) % MOD;
        b >>= 1;
    }
    return ret;
}

signed main() {
    int N,M,X;
    cin>>N>>M>>X;
    vector<vector<int>> e(M);
    REP(i,M) {
        int u,v,w;
        cin>>u>>v>>w;
        u--,v--;
        e[i]={w,u,v};
    }
    vector<int> w(M,0);
    REP(i,M) {
        union_find uf(N);
        w[i]+=e[i][0];
        uf.unite(e[i][1],e[i][2]);
        heap<vector<int>> hp;
        REP(j,M) hp.push(e[j]);
        while(!hp.empty()) {
            auto edge=hp.top(); hp.pop();
            if(!uf.same(edge[1],edge[2])) {
                w[i]+=edge[0];
                uf.unite(edge[1],edge[2]);
            }
        }
    }

    map<int,int> cnt;
    cnt[X-1]=cnt[X]=0;
    REP(i,M) cnt[w[i]]++;
    ITR(itr,next(begin(cnt)),end(cnt)) itr->second+=prev(itr)->second;
    auto f=[&](int x) {
        if(cnt[x]==0) {
            return bin_pow_mod(2,M);
        } else {
            return bin_pow_mod(2,M-cnt[x]+1);
        }
    };
    int ans=(f(X-1)-f(X)+MOD)%MOD;
    cout<<ans<<endl;
    return 0;
}



Measured memory_bytes: 608