// Source: https://usaco.guide/general/io

#include <bits/stdc++.h>
using namespace std;

#define int long long

vector<vector<pair<int, int> > > adj;
int ans = 0;
int m;
vector<int> dist;

void dfs(int v) {
    int distmx = 0;
    for(auto [u, w] : adj[v]) {
        dfs(u);
        distmx = max(distmx, dist[u]+w);
    }
    //cout << v << ' ' << m << ' ' << distmx << endl;

    if (distmx > m) {
        ans++;
        dist[v] = 0;
    } else {
        dist[v] = distmx;
    }
    return;
}

signed main() {
    int n, k;
    cin >> n >> k;
    adj.resize(n+1);

    dist.assign(n+1, 0);
    for(int i = 2; i <= n; i++) {
        int x, y;
        cin >> x >> y;

        adj[x].push_back({i, y});
    }

    int l = 0, r = 1000;
    int realans = 1000;

    while(l <= r) {
        //cout << l << ' ' << r << endl;
        m = (l+r)/2;

        ans = 0;
        dfs(1);

        if (ans <= k) {
            realans = min(realans, m);
            r = m-1;
        } else {
            l = m+1;
        }
    }

    cout << realans << endl;



}
/*
5 1
1 5
1 2
2 4
2 2
*/