#include <fstream>
#include <vector>
#include <queue>
#define NMAX 50005
#define inf (1 << 25)

using namespace std;

ifstream f("camionas.in");
ofstream g("camionas.out");

int i, n, m, gr, a, b, c, d[NMAX];
bool visited[NMAX];
vector < pair < int, int > > v[NMAX];

struct compare
{
    bool operator () (pair < int, int > &a, pair < int, int > &b)
    {
        return a.second > b.second;
    }
};

priority_queue < pair < int, int >, vector < pair < int, int > >, compare > pq;

void read()
{
    f >> n >> m >> gr;

    for (i = 1; i <= m; ++ i)
    {
        f >> a >> b >> c;

        if (c < gr)
            c = 1;
        else
            c = 0;

        v[a].push_back(make_pair(b, c));
        v[b].push_back(make_pair(a, c));
    }
}

void initialize()
{
    for (i = 1; i <= n; ++ i)
    {
        d[i] = inf;
        visited[i] = 0;
    }
}

void dijkstra()
{
    pq.push(make_pair(1, 0));
    d[1] = 0;

    while (!pq.empty())
    {
        int current = pq.top().first;
        pq.pop();

        if (!visited[current])
        {
            visited[current] = 1;

            for (auto &it : v[current])
                if (d[it.first] > d[current] + it.second)
            {
                d[it.first] = d[current] + it.second;
                pq.push(make_pair(it.first, d[it.first]));
            }
        }
    }
}

int main()
{
    read();
    initialize();
    dijkstra();

    g << d[n] << '\n';
    return 0;
}