#include<bits/stdc++.h>
using namespace std;
using ll = long long;
const ll linf = 1e18;

template<typename T>
bool chmin(T &a, const T &b){
    if (a <= b) return false;
    a = b;
    return true;
}

template<typename T>
bool chmax(T &a, const T &b){
    if (a >= b) return false;
    a = b;
    return true;
}

int main(){
    int n; cin >> n;
    ll k; cin >> k;
    vector<int> rs(n);
    vector<ll> xs(n);
    for (int i = 0; i < n; i++){
        cin >> rs[i] >> xs[i];
    }
    for (int i = 0; i < n; i++){
        vector<ll> hs(n+1,0);
        vector<bool> root(n+1,false);
        root[n] = true;
        for (int j = n-1; j >= 0; j--){
            if (j == i) continue;
            root[j] = root[rs[j]];
            hs[j] = hs[rs[j]] + xs[j];
        }
        ll le = -linf, ri = linf;
        for (int j = 0; j < n; j++){
            ll a = hs[j] - hs[j+1];
            if (root[j] == root[j+1]){
                if (a < 0 || a > k){
                    le = linf+1;
                }
            }
            else if (root[j]){
                chmin(ri,a);
                chmax(le,a-k);
            }
            else {
                chmin(ri,k-a);
                chmax(le,-a);
            }
        }
        cout << (le <= ri ? "Yes" : "No") << '\n';
    }
}