#include <iostream>
#include <algorithm>
#include <iomanip>
#include <vector>
#include <queue>
#include <deque>
#include <set>
#include <map>
#include <tuple>
#include <cmath>
#include <numeric>
#include <functional>
#include <cassert>

#define debug_value(x) cerr << "line" << __LINE__ << ":<" << __func__ << ">:" << #x << "=" << x << endl;
#define debug(x) cerr << "line" << __LINE__ << ":<" << __func__ << ">:" << x << endl;

template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }

using namespace std;
typedef long long ll;

template<typename T>
vector<vector<T>> vec2d(int n, int m, T v){
    return vector<vector<T>>(n, vector<T>(m, v));
}

template<typename T>
vector<vector<vector<T>>> vec3d(int n, int m, int k, T v){
    return vector<vector<vector<T>>>(n, vector<vector<T>>(m, vector<T>(k, v)));
}

template<typename T>
void print_vector(vector<T> v, char delimiter=' '){
    if(v.empty()) {
        cout << endl;
        return;
    }
    for(int i = 0; i+1 < v.size(); i++) cout << v[i] << delimiter;
    cout << v.back() << endl;
}

void solve(){
    int n, m; cin >> n >> m;
    vector<int> a(n+1);
    a[0] = m;
    for(int i = 1; i <= n; i++){
        cin >> a[i];
    }
    auto cnt = vec2d(n+1, 3, 0);
    cnt[0][1] = a[1];
    cnt[0][2] = a[0]-a[1];
    for(int i = 1; i < n; i++){
        cnt[i][1] = a[i+1]-cnt[i-1][2];
        cnt[i][2] = a[i]-cnt[i][1];
    }
    for(int i = 0; i < n; i++){
        if(cnt[i][1] < 0 || cnt[i][2] < 0){
            cout << "No" << endl;
            return;
        }
    }
    if(cnt[n-1][1] != a[n-1]){
        cout << "No" << endl;
    }else{
        cout << "Yes" << endl;
    }
}

int main(){
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout << setprecision(10) << fixed;
    int t; cin >> t;
    while(t--) solve();
}