#include <bits/stdc++.h>
#pragma GCC optimize("-O3")
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
using namespace std;
const long long MOD = 998244353;
long long n, m, k, q, p, ans, l, r, i, j, x, y;
pair<long long, pair<long long, long long> > a[200001];
vector<pair<long long, long long> > c[200001];
vector<long long> v;
long long d[200001];
bool t[1000001], tt[1000001];
string s;
int main() {
  cin >> n >> m >> k;
  for (int i = 0; i < m; i++) {
    cin >> a[i].second.first >> a[i].second.second >> a[i].first;
  }
  sort(a, a + m);
  for (int i = 0; i < k; i++) {
    c[a[i].second.first].push_back(make_pair(a[i].second.second, a[i].first));
    c[a[i].second.second].push_back(make_pair(a[i].second.first, a[i].first));
    long long x = a[i].second.first;
    long long y = a[i].second.second;
    if (!t[x]) v.push_back(x), t[x] = 1;
    if (!t[y]) v.push_back(y), t[y] = 1;
  }
  vector<long long> z;
  for (int i = 0; i < v.size(); i++) {
    for (int j = 0; j < v.size(); j++) d[v[j]] = 1e18;
    set<pair<long long, long long> > q;
    d[v[i]] = 0;
    q.insert(make_pair(0, v[i]));
    while (q.size()) {
      long long x = (*q.begin()).second, h = (*q.begin()).first;
      q.erase(q.begin());
      for (int j = 0; j < c[x].size(); j++)
        if (d[c[x][j].first] > h + c[x][j].second) {
          q.erase(make_pair(d[c[x][j].first], c[x][j].first));
          d[c[x][j].first] = h + c[x][j].second;
          q.insert(make_pair(d[c[x][j].first], c[x][j].first));
        }
    }
    for (int j = i + 1; j < v.size(); j++) {
      z.push_back(d[v[j]]);
    }
  }
  sort(z.begin(), z.end());
  cout << z[k - 1] << "\n";
  return 0;
}
