#include<iostream>
#include<cstdio>
#include<cstring>
using namespace std;const int maxn = 1005;
const int inf = 0x3f3f3f3f;
int n,m,x,y,MAX,cnt,minx,maxx;
int dp[maxn][maxn],h[maxn];
struct Node
{int xl,xr,h;int next;
}node[maxn];void init()
{memset(dp,-1,sizeof(dp));memset(h,-1,sizeof(h));cnt = 0;minx = inf;maxx = 0;
}void add(int XL,int XR,int H)
{int t = h[H];node[cnt].xl = XL;node[cnt].xr = XR;node[cnt].h = H;node[cnt].next = -1;if(t == -1)h[H] = cnt++;else{node[cnt].next = t;h[H] = cnt++;}
}int search(int H,int X) //返回节点编号
{int t = h[H];while(t != -1){if(node[t].xl <= X && node[t].xr >= X)return t;t = node[t].next;}return -1;
}void solve()
{//先找到落在的第一块板上int hei;for(hei = 0; hei <= MAX; hei++){int t = search(y-hei,x);if(t != -1){dp[node[t].xl][y-hei] = hei + x-node[t].xl;dp[node[t].xr][y-hei] = hei + node[t].xr - x;break;}}for(int j = y-hei; j >= 0; j--)for(int i = maxx; i >= minx; i--)for(int k = 1; k <= MAX; k++){if(dp[i][j] == -1) break;if(j - k == 0){dp[i][0] = dp[i][j] + k;break;}int t = search(j-k,i);if(t == -1) continue;if(dp[node[t].xl][j-k] == -1)dp[node[t].xl][j-k] = dp[i][j] + k + i - node[t].xl;else dp[node[t].xl][j-k] = min(dp[node[t].xl][j-k],dp[i][j] + k + i - node[t].xl);if(dp[node[t].xr][j-k] == -1)dp[node[t].xr][j-k] = dp[i][j] + k + node[t].xr - i;else dp[node[t].xr][j-k] = min(dp[node[t].xr][j-k],dp[i][j] + k + node[t].xr - i);break;}int ans = inf;for(int i = 0; i <= 1000; i++)if(dp[i][0] != -1)ans = min(ans,dp[i][0]);if(ans > m) cout<<"YES"<<endl;else cout<<"NO"<<endl;
}int main()
{int t;cin>>t;while(t--){init();cin>>n>>x>>y>>MAX>>m;for(int i = 1; i <= n; i++){int XL,XR,H;cin>>XL>>XR>>H;minx = min(minx,XL);maxx = max(maxx,XR);add(XL,XR,H);}solve();}return 0;
}