#include <bits/stdc++.h>
using namespace std;
struct TP {
  int u;
  int v;
  long long w;
};
bool cmp1(TP a, TP b) { return a.w < b.w; }
struct cmp {
  bool operator()(TP a, TP b) { return a.w > b.w; }
};
vector<TP> g[1000001];
int n, m, k, c, K, used[1000001];
TP t, a[1000001];
long long d[1000001];
priority_queue<TP, vector<TP>, cmp> H;
priority_queue<TP, vector<TP>, cmp> Res;
void Dij(int s) {
  TP t;
  for (int i = 1; i <= n; i++) d[i] = 1e15;
  d[s] = 0;
  t.u = s;
  t.w = 0;
  H.push(t);
  while (!H.empty()) {
    t = H.top();
    H.pop();
    if (d[t.u] < t.w) continue;
    for (int i = 0; i < g[t.u].size(); i++) {
      int v = g[t.u][i].v;
      long long w = g[t.u][i].w;
      if (d[v] > d[t.u] + w) {
        d[v] = d[t.u] + w;
        TP tmp;
        tmp.u = v;
        tmp.w = d[v];
        H.push(tmp);
      }
    }
  }
  for (int i = 1; i <= n; i++)
    if (i != s && d[i] < 1e15) {
      t.w = d[i];
      Res.push(t);
    }
}
int main() {
  ios_base::sync_with_stdio(false);
  cin >> n >> m >> K;
  for (int i = 1; i <= m; i++) {
    cin >> t.u >> t.v >> t.w;
    a[i] = t;
  }
  k = min(K, m);
  sort(a + 1, a + m + 1, cmp1);
  for (int i = 1; i <= k; i++) {
    used[a[i].u] = -1;
    used[a[i].v] = -1;
  }
  for (int u = 1; u <= n; u++)
    if (used[u] == -1) {
      c++;
      used[u] = c;
    }
  for (int i = 1; i <= k; i++) {
    t.u = used[a[i].u];
    t.v = used[a[i].v];
    t.w = a[i].w;
    g[t.u].push_back(t);
    swap(t.u, t.v);
    g[t.u].push_back(t);
  }
  n = c;
  for (int u = 1; u <= n; u++) Dij(u);
  c = 0;
  while (!Res.empty()) {
    c++;
    if (c == K * 2) {
      TP res = Res.top();
      cout << res.w;
      break;
    }
    Res.pop();
  }
}
