#include <bits/stdc++.h>
using namespace std;
const int prime = 999983;
const int INF = 0x7FFFFFFF;
const long long INFF = 0x7FFFFFFFFFFFFFFF;
const double pi = acos(-1.0);
const double inf = 1e18;
const double eps = 1e-6;
const long long mod = 1e9 + 7;
long long qpow(long long a, long long b) {
  long long s = 1;
  while (b > 0) {
    if (b & 1) s = s * a % mod;
    a = a * a % mod;
    b >>= 1;
  }
  return s;
}
long long gcd(long long a, long long b) { return b ? gcd(b, a % b) : a; }
int dr[2][4] = {1, -1, 0, 0, 0, 0, -1, 1};
const int maxn = 1000 + 10;
long long w[maxn][maxn];
long long dis[maxn][maxn];
struct Edge {
  int u, v;
  long long w;
};
bool operator<(const Edge &a, const Edge &b) { return a.w < b.w; }
vector<Edge> edges;
int main(void) {
  int n, m, k;
  cin >> n >> m >> k;
  priority_queue<long long, vector<long long>, greater<long long>> Q;
  for (int i = 1; i <= 1000 + 1; ++i)
    for (int j = 1; j <= 1000 + 1; ++j) dis[i][j] = (i == j ? 0 : 1e15);
  if (n > 400) {
    for (int i = 1; i <= m; ++i) {
      int u, v, w;
      scanf("%d%d%d", &u, &v, &w);
      edges.push_back(Edge{u, v, w});
    }
    sort(edges.begin(), edges.end());
    while ((int)edges.size() > k) edges.pop_back();
    map<int, int> ma;
    int cnt = 0;
    for (auto c : edges) {
      if (ma[c.u] == 0) ma[c.u] = ++cnt;
      if (ma[c.v] == 0) ma[c.v] = ++cnt;
    }
    for (auto c : edges) {
      int u = ma[c.u], v = ma[c.v];
      dis[u][v] = dis[v][u] = c.w;
    }
    n = cnt;
  } else {
    for (int i = 1; i <= m; ++i) {
      int u, v, w;
      scanf("%d%d%d", &u, &v, &w);
      dis[u][v] = dis[v][u] = w;
    }
  }
  for (int k = 1; k <= n; ++k)
    for (int i = 1; i <= n; ++i)
      for (int j = 1; j <= n; ++j)
        dis[i][j] = min(dis[i][j], dis[i][k] + dis[j][k]);
  for (int i = 1; i <= n; ++i) {
    for (int j = i + 1; j <= n; ++j) {
      Q.push(dis[i][j]);
    }
  }
  for (int i = 1; i < k; ++i) {
    Q.top();
    Q.pop();
  }
  cout << Q.top() << endl;
  return 0;
}
