#include <bits/stdc++.h>   using namespace std;   const int maxn = 200000 + 10;   int T, n, m, sum, du[maxn], K;   vector<pair<int, int> > p[maxn];   struct node {     int x, y;     long long val;     bool operator<(const node i) const { return val < i.val; }   } a[maxn];   queue<int> q2;   int b[maxn], cnt;   long long dis[1000][1000];   long long ans[maxn], sum1, INF;   int main() {     cin >> n >> m >> K;     for (int i = 1; i <= m; i++) {       scanf( %d %d %lld , &a[i].x, &a[i].y, &a[i].val);     }     sort(a + 1, a + m + 1);     int Mx = min(m, K);     memset(dis, 0x3f, sizeof(dis));     INF = dis[0][0];     for (int i = 1; i <= Mx; i++) {       if (!b[a[i].x]) {         cnt++;         b[a[i].x] = cnt;       }       if (!b[a[i].y]) {         cnt++;         b[a[i].y] = cnt;       }       dis[b[a[i].x]][b[a[i].y]] = dis[b[a[i].y]][b[a[i].x]] = a[i].val;     }     for (int i = 1; i <= cnt; i++) dis[i][i] = 0;     for (int k = 1; k <= cnt; k++) {       for (int i = 1; i <= cnt; i++) {         for (int j = 1; j <= cnt; j++) {           dis[i][j] = min(dis[i][k] + dis[k][j], dis[i][j]);         }       }     }     for (int i = 1; i <= cnt; i++) {       for (int j = i + 1; j <= cnt; j++) {         if (i != j && dis[i][j] != INF) {           ans[++sum1] = dis[i][j];         }       }     }     sort(ans + 1, ans + sum1 + 1);     cout << ans[K] << endl;     return 0;   }   