#include <bits/stdc++.h>

using namespace std;
ifstream f("camionas.in");
ofstream g("camionas.out");
vector <pair <int,int>  > v[50005];
priority_queue <pair <int,int> ,vector <pair <int,int> > ,greater <pair <int,int> > > h;
int n,m,gr,i,x,y,cost,mini[50005],j,nod,nr,c;
bool sel[50005];
int main()
{
    f>>n>>m>>gr;
    for (i=1;i<=m;i++)
    {
        f>>x>>y>>cost;
        if (cost<gr)
        {
            cost=1;
        }
        else
        {
            cost=0;
        }
        v[x].push_back({y,cost});
        v[y].push_back({x,cost});
    }
    for (i=1;i<=n;i++)
    {
        mini[i]=-1;
    }
    mini[1]=0;
    sel[1]=1;
    for (j=0;j<v[1].size();j++)
    {
        x=v[1][j].first;
        mini[x]=v[1][j].second;
        h.push({v[1][j].second,x});
    }
    nr=v[1].size();
    while (nr!=0)
    {
        while (!h.empty()&&sel[h.top().second]==1)
        {
            h.pop();
        }
        c=h.top().second;
        sel[c]=1;
        h.pop();
        nr--;
        for (i=0;i<v[c].size();i++)
        {
            j=v[c][i].first;
            if (mini[j]==-1)
            {
                nr++;
                mini[j]=mini[c]+v[c][i].second;
                h.push({mini[j],v[c][i].first});
            }
            else
            if (mini[j]>mini[c]+v[c][i].second)
            {
                mini[j]=mini[c]+v[c][i].second;
                h.push({mini[j],j});
            }
        }
    }
    g<<mini[n];
    return 0;
}