#include <bits/stdc++.h>
using namespace std;
#define InTheNameOfGod ios::sync_with_stdio(0);cin.tie(0); cout.tie(0);
using ll = long long;

const ll maxN = 2e5 + 5;
const ll MOD = 1e9 + 7;

ll n, k;
vector<vector<pair<ll, ll> > > g;
vector<ll> val, b;
ll a;

void dfs1(ll x)
{
    for(pair<ll, ll> sz : g[x]) {
        val[sz.first] = val[x] + sz.second;
        dfs1(sz.first);
    }
}

ll dfs(ll x, ll mid) {
    ll maxi = 0;

    for(pair<ll, ll> sz : g[x]) {
        ll temp = dfs(sz.first, mid);
        maxi = max(maxi, temp);
    }

    maxi += b[x];

    if(maxi > mid) {
        a++;
        maxi = 0;
    }

    return maxi;
}

int main() {
   InTheNameOfGod;
    
    cin >> n >> k;

    g.resize(n+1);
    val.resize(n+1, 0);
    b.resize(n+1, 0);

    for(ll i = 2; i <= n; i++) {
        ll x,y;
        cin >> x >> y;
        g[x].push_back({i, y});
        b[i] = y;
    }

    dfs1(1);

    ll maxi = 0;
    for(ll i = 1; i <= n; i++) maxi = max(maxi, val[i]);

    ll l = 0, r = maxi, mid, mo;
    while(l < r) {
        mid = (l + r) / 2;
        val.assign(n+1, 0);
        a = 0;
        dfs(1, mid);

        if(a > k) {
            l = mid + 1;         
        }
        else {
            r = mid - 1;
            mo = mid;
        }
    }
    cout << mo;

    return 0;
}