#include <bits/stdc++.h>

using namespace std;

#define forn(i,n) for(int i = 0; i <(int)n; ++i)
#define vi vector<int>
#define debug(x)    cout << #x << " : " << x << endl;

const int MOD = 1000000007;
//const int MOD = 998244353;

void solve() {
    int n, th;
    cin >> n >> th;

    int par[n+5][2];
    int weight[n+5];
    unordered_set<int> s[n+5];
    forn(i, n+5) {
        s[i].insert(i);
    }
    memset(weight, 0, sizeof(weight));

    int totweight[n+5];
    memset(totweight, 0, sizeof(totweight));
    forn(i, n) {
        int x, y, z, w;
        cin >> x >> y >> z >> w;
        par[x][0] = y;
        par[x][1] = z;
        weight[x] = w;
    }

    for (int i = n + 1; i >= 2; i--) {
        s[par[i][0]].insert(s[i].begin(), s[i].end());
        s[par[i][1]].insert(s[i].begin(), s[i].end());
    }
    int tot = 0;

    for (int i = 2; i <= n + 1; i++) {
        for (auto p: s[i]) {
            totweight[i] += weight[p];
        }
    }

    for (int i = 2; i <= n + 1; i++) {
        if (totweight[i] >= th) {
            cout << i << ' ' << totweight[i] << endl;
            tot++;
        }
    }

    cout << tot << endl;
}

int32_t main()
{
    ios::sync_with_stdio(false); cin.tie(NULL);
    int tc = 1;
    // cin >> tc;
    while(tc--) {
        solve();
    }
    return 0;
}