from collections import deque
N,K=map(int,input().split())
R=[]
G=[[] for _ in range(N+1)]
for i in range(N):
    r,x=map(int,input().split())
    R.append(r)
    G[i].append([r,x])
    G[r].append([i,-x])
answers=[]
que=deque([0])
for i in range(N):
    Group_num=[-1]*(N+1)
    que=deque([0])
    Group_num[0]=1
    B=[0]*(N+1)
    seen=[False]*(N+1)
    seen[0]=True
    que=deque([0])
    diff_L=-10**19
    diff_R=10**19
    ans="Yes"
    while len(que):
        p=que.popleft()
        for (q,x) in G[p]:
            if(not seen[q]):
                if((p==i and q==R[i]) or (q==i and p==R[i])):
                    Group_num[q]=2
                else:
                    Group_num[q]=Group_num[p]
                que.append(q)
                seen[q]=True
                B[q]=B[p]+x
    for i in range(N):
        if(Group_num[i]==Group_num[i+1]):
            if(B[i+1]-B[i]<0 or B[i+1]-B[i]>K):
                ans="No"
        else:
            if(Group_num[i]==1 and Group_num[i+1]==2):
                Left=B[i+1]-B[i]-K
                Right=B[i+1]-B[i]
            else:
                Left=B[i]-B[i+1]
                Right=K+B[i]-B[i+1]
            diff_L=max(diff_L,Left)
            diff_R=min(diff_R,Right)
            if(diff_L>diff_R):
                ans="No"
    answers.append(ans)
for ans in answers:
    print(ans)