#include <bits/stdc++.h>
using namespace std;
const int inf = 2000000000;
const long long infLL = 900000000000000000;
template <typename first, typename second>
ostream &operator<<(ostream &os, const pair<first, second> &p) {
  return os << "(" << p.first << ", " << p.second << ")";
}
template <typename T>
ostream &operator<<(ostream &os, const vector<T> &v) {
  os << "{";
  for (auto it = v.begin(); it != v.end(); ++it) {
    if (it != v.begin()) os << ", ";
    os << *it;
  }
  return os << "}";
}
template <typename T>
ostream &operator<<(ostream &os, const set<T> &v) {
  os << "[";
  for (auto it = v.begin(); it != v.end(); ++it) {
    if (it != v.begin()) os << ",";
    os << *it;
  }
  return os << "]";
}
template <typename T>
ostream &operator<<(ostream &os, const multiset<T> &v) {
  os << "[";
  for (auto it = v.begin(); it != v.end(); ++it) {
    if (it != v.begin()) os << ", ";
    os << *it;
  }
  return os << "]";
}
template <typename first, typename second>
ostream &operator<<(ostream &os, const map<first, second> &v) {
  os << "[";
  for (auto it = v.begin(); it != v.end(); ++it) {
    if (it != v.begin()) os << ", ";
    os << it->first << " = " << it->second;
  }
  return os << "]";
}
void faltu() { cerr << '\n'; }
template <typename T>
void faltu(T a[], int n) {
  for (int i = 0; i < n; ++i) cerr << a[i] << ' ';
  cerr << '\n';
}
template <typename T, typename... hello>
void faltu(T arg, const hello &...rest) {
  cerr << arg << ' ';
  faltu(rest...);
}
const int mx = 2e5 + 5;
vector<pair<pair<int, int>, int>> vec;
long long dp[805][805];
map<int, int> mp;
vector<int> store;
bool cmp(const pair<pair<int, int>, int> &lhs,
         const pair<pair<int, int>, int> &rhs) {
  return lhs.second < rhs.second;
}
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  ;
  int n, m, k;
  cin >> n >> m >> k;
  for (int i = 0; i < m; ++i) {
    int x, y, w;
    cin >> x >> y >> w;
    vec.push_back(make_pair(make_pair(x, y), w));
  }
  sort(vec.begin(), vec.end(), cmp);
  for (int i = 0; i < k && i < (int)vec.size(); ++i) {
    int u, v, w;
    u = vec[i].first.first, v = vec[i].first.second, w = vec[i].second;
    store.push_back(u), store.push_back(v);
  }
  sort(store.begin(), store.end());
  store.erase(unique(store.begin(), store.end()), store.end());
  for (int i = 0; i < (int)store.size(); ++i) {
    mp[store[i]] = i + 1;
  }
  int N = (int)store.size();
  for (int i = 1; i <= N; ++i)
    for (int j = 1; j <= N; ++j) dp[i][j] = infLL;
  for (int i = 1; i <= N; ++i) dp[i][i] = 0;
  for (int i = 0; i < k && i < (int)vec.size(); ++i) {
    int u, v, w;
    u = vec[i].first.first, v = vec[i].first.second, w = vec[i].second;
    dp[mp[u]][mp[v]] = dp[mp[v]][mp[u]] = w;
  }
  for (int kk = 1; kk <= N; ++kk) {
    for (int i = 1; i <= N; ++i) {
      for (int j = 1; j <= N; ++j) {
        dp[i][j] = min(dp[i][j], dp[i][kk] + dp[kk][j]);
      }
    }
  }
  vector<long long> ans;
  for (int i = 1; i <= N; ++i) {
    for (int j = i + 1; j <= N; ++j) {
      ans.push_back(dp[i][j]);
    }
  }
  sort(ans.begin(), ans.end());
  cout << ans[k - 1] << '\n';
}
