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

#define all(v) v.begin(),v.end()
using ll = long long;
using ull = unsigned long long;
using vll=vector<ll>;
using vvll = vector<vector<ll>>;
using P = pair<ll,ll>;
using vp=vector<pair<ll, ll>>;

const ll INF=1ll<<60;
ll mod10=1e9+7;
ll mod99=998244353;
const double PI = acos(-1);

#define rep(i,n) for (ll i=0;i<n;++i)
#define per(i,n) for(ll i=n-1;i>=0;--i)
#define rep2(i,a,n) for (ll i=a;i<n;++i)
#define per2(i,a,n) for (ll i=a;i>=n;--i)

template <typename T>
bool chmax(T &a,const T& b){
    if(a<b){
        a=b;
        return true;
    }
    return false;
}

template <typename T>
bool chmin(T &a,const T& b){
    if(a>b){
        a=b;
        return true;
    }
    return false;
}

void makeab(ll M,vector<vector<pair<long long,long long>>>& ab,map<tuple<ll,ll,ll>,ll>& mp){
    for(int i=0;i<M;i++){
        ll a,b,c;
        cin>>a>>b>>c;
        a--;b--;
        ab[a].emplace_back(c,b);
        ab[b].emplace_back(c,a);
        ll d;
        cin>>d;
        mp[{a,b,c}]=d;
        mp[{b,a,c}]=d;
    }
}

vector<ll> di(long long s,vector<vector<pair<long long,long long>>>& ab,map<tuple<ll,ll,ll>,ll>& mp,ll m){
    long long N=ab.size();
    priority_queue<pair<long long,long long>,vector<pair<long long,long long>>,greater<pair<long long,long long>>> pq;
    vector<long long> dist(N,(1ll<<60));
    dist[s]=0;
    pq.emplace(0,s);
    while(!pq.empty()){
        auto [cost,now]=pq.top();pq.pop();
        if(dist[now]<cost)continue;
        for(auto [tcost,to]:ab[now]){
            if(mp[{now,to,tcost}]<m)continue;
            if(chmin(dist[to],cost+tcost)){
                pq.emplace(dist[to],to);
            }
        }
    }
    return dist;
}

int main(){
    ll N,M,X;
    cin>>N>>M>>X;
    vector<vector<P>> ab(N);
    map<tuple<ll,ll,ll>,ll> mp;
    makeab(M,ab,mp);
    ll l=-1,r=1e10;
    while(r-l>1){
        ll m=(r+l)/2;
        vll d=di(0,ab,mp,m);
        if(d[N-1]<=X)l=m;
        else r=m;
    }
    cout << (l==0?-1:l) << endl;
}