#include<bits/stdc++.h>

using namespace std;

int MX, nr, N, dis, rv[100009], stk[100009], H[100009], h[100009], aib[100009];
long long K, knt;
vector < pair < int, int > > v[100009];
vector < int > fii[100009];
pair < int, int > nor[100009];

void dfs (int nod, int tata)
{
    for (vector < pair < int, int > > :: iterator it = v[nod].begin (); it != v[nod].end (); it ++)
        if (it->first != tata)
            H[it->first] = H[nod] + it->second, dfs (it->first, nod), fii[nod].push_back (it->first);
}

void Update (int pos, int val)
{
    while (pos <= dis)
        aib[pos] += val, pos += pos - (pos & (pos - 1));
}

int Query (int pos)
{
    int sum = 0;
    while (pos)
        sum += aib[pos], pos &= pos - 1;
    return sum;
}

void solve (int nod)
{
    int p = 1, u = dis, mij, ras = dis + 1, lim = H[nod] - MX;
    while (p <= u)
    {
        mij = (p + u) >> 1;
        if (rv[mij] >= lim) ras = mij, u = mij - 1;
        else p = mij + 1;
    }
    knt += Query (dis - ras + 1);
    stk[++nr] = nod, Update (dis - h[stk[nr]] + 1, +1);
    for (vector < int > :: iterator it = fii[nod].begin (); it != fii[nod].end (); it ++)
        solve (*it);
    Update (dis - h[stk[nr]] + 1, -1), nr --;
}

long long Knt (int val)
{
    MX = val, knt = 0;
    solve (1);
    return knt;
}

int main()
{
//freopen ("input", "r", stdin);
//freopen ("output", "w", stdout);

scanf ("%d %lld", &N, &K);
for (int i=1; i<N; i++)
{
    int x, y, z;
    scanf ("%d %d %d", &x, &y, &z);
    v[x].push_back (make_pair (y, z)), v[y].push_back (make_pair (x, z));
}
dfs (1, -1);

for (int i=1; i<=N; i++)
    nor[i] = make_pair (H[i], i);
sort (nor + 1, nor + N + 1);
for (int i=1; i<=N; i++)
{
    if (i == 1 || nor[i].first != nor[i - 1].first) rv[++dis] = nor[i].first;
    h[nor[i].second] = dis;
}

//printf ("%lld\n", Knt (5));
int p = 0, u = 1000000001, mij, ras = -1;
while (p <= u)
{
    mij = (p + u) >> 1;
  //  printf ("%d -> %lld\n", mij, Knt (mij));
    if (Knt (mij) >= K) ras = mij, u = mij - 1;
    else p = mij + 1;
}
printf ("%d\n", ras);

return 0;
}