#include <bits/stdc++.h>
#include <random>

using namespace std;

typedef long long ll;
typedef long double ld;
typedef pair<long long, long long> p32;
typedef pair<ll, ll> p64;
typedef pair<double, double> pdd;
typedef vector<ll> v64;
typedef vector<long long> v32;
typedef vector<vector<long long>> vv32;
typedef vector<vector<ll>> vv64;
typedef vector<vector<p64>> vvp64;
typedef vector<p64> vp64;
typedef vector<p32> vp32;
ll MOD = 998244353;
double eps = 1e-12;
#define forn(i, e) for (ll i = 0; i < e; i++)
#define forsn(i, s, e) for (ll i = s; i < e; i++)
#define rforn(i, s) for (ll i = s; i >= 0; i--)
#define rforsn(i, s, e) for (ll i = s; i >= e; i--)
#define ln "\n"
#define dbg(x) cout << #x << " = " << x << ln
#define mp make_pair
#define pb push_back
#define fi first
#define se second
#define INF 2e18
#define fast_cin()                    \
    ios_base::sync_with_stdio(false); \
    cin.tie(NULL);                    \
    cout.tie(NULL)
#define all(x) (x).begin(), (x).end()
#define sz(x) ((ll)(x).size())

int main()
{
    fast_cin();
    //freopen("in.txt", "r", stdin);
    long long n;
    cin >> n;
    long long k;
    cin >> k;

    vector<pair<long long, long long>> a(n + 1);
    for (long long i = 2; i <= n; i++)
    {
        cin >> a[i].first >> a[i].second;
    }
    
    vector<pair<long long, long long>> under(n + 1);
    for (long long i = n; i >= 2; i--)
    {
        under[i].second = i;
        under[i].first += 1;
        under[a[i].first].first += under[i].first;
    }
    under[1].first = 0;
    for (long long i = 2; i <= n; i++)
    {
        under[i].first *= a[i].second;
    }

    sort(under.begin(), under.end());

    for (long long i = n; i > n - k; i--)
    {
        a[under[i].second].first = 0;
        a[under[i].second].second = 0;
    }

    vector<long long> ans(n + 1);
    for(long long i = 2; i <= n; i++){
        ans[i] += ans[a[i].first] + a[i].second;
    }

    sort(ans.begin(), ans.end());
    cout << ans[n];

    return 0;
}