#include <bits/stdc++.h>
using namespace std;
pair<int, pair<int, int> > p[200100];
int a[200100];
int flag[200100];
long long dis[1000][1000];
multiset<long long> se;
multiset<long long>::iterator it;
int main() {
  int n, m, k;
  scanf("%d%d%d", &n, &m, &k);
  for (int i = 1; i <= m; i++) {
    int u, v, w;
    scanf("%d%d%d", &u, &v, &w);
    p[i] = pair<int, pair<int, int> >(w, pair<int, int>(u, v));
  }
  sort(p + 1, p + m + 1);
  int cnt = 1;
  for (int i = 1; i <= min(k, m); i++) {
    if (flag[p[i].second.first] == 0) {
      a[p[i].second.first] = cnt++;
      flag[p[i].second.first] = 1;
    }
    if (flag[p[i].second.second] == 0) {
      a[p[i].second.second] = cnt++;
      flag[p[i].second.second] = 1;
    }
    dis[a[p[i].second.second]][a[p[i].second.first]] = p[i].first;
    dis[a[p[i].second.first]][a[p[i].second.second]] = p[i].first;
  }
  for (int i = 1; i < cnt; i++) {
    for (int j = 1; j < cnt; j++) {
      if (i == j) continue;
      if (!dis[i][j]) dis[i][j] = 0x3f3f3f3f3f3f3f3f;
    }
  }
  for (int i = 1; i < cnt; i++) {
    for (int j = 1; j < cnt; j++) {
      for (int k = 1; k < cnt; k++) {
        dis[j][k] = min(dis[j][k], dis[j][i] + dis[i][k]);
      }
    }
  }
  for (int i = 1; i < cnt; i++) {
    for (int j = i + 1; j < cnt; j++) {
      se.insert(dis[i][j]);
      if (se.size() > k) se.erase(--se.end());
    }
  }
  cout << *--se.end() << endl;
  return 0;
}
