def solve():
    n,m = map(int,input().split())
    dp = [0]*(n+2)
    dp[0] = m
    A = list(map(int,input().split()))
    for i,a in enumerate(A):
        if dp[i+1] > a:
            return "No"

        dif = a-dp[i+1]
        if dp[i] < dif:
            return "No"
        dp[i+2] += dp[i]-dif
        dp[i+1] = a
    if dp[n] != A[-1]:
        return "No"
    return "Yes"
t = int(input())
for _ in range(t):
    print(solve())