#pragma GCC optimize("Ofast,unroll-loops")
//#pragma GCC optimize("conserve-stack")
#include<bits/stdc++.h>
//#define int long long
#define ll long long
#define down cout<<'\n';
#define debug cout<<" cucuucucuuu",down
#define NHP ios_base::sync_with_stdio(0);cout.tie(0);cin.tie(0);
#define modwwe int t;cin>>t; while(t--)
#define bit(i,j) (i>>j&1)
#define sobit(a) __builtin_popcountll(a)
#define task "test"
#define fin(x) freopen(x".inp","r",stdin)
#define fou(x) freopen(x".out","w",stdout)
#define pb push_back
#define mask(i) (1<<i)
#define checktime cerr << (double)clock() / CLOCKS_PER_SEC * 1000 << " ms";
using namespace std;
#define getchar_unlocked getchar
inline int scan()
{
char c = getchar_unlocked();
int x = 0;
while (c < '0' || c > '9')
{
c = getchar_unlocked();
}
while (c >= '0' && c <= '9')
{
x = (x << 1) + (x << 3) + c - '0';
c = getchar_unlocked();
}
return x;
};
void phongbeo();
const int inf = 1e18;
const int mod2 = 1e9 + 7;
const int mod1 = 998244353;
int add(int x,int y)
{
if(x+y>=mod2) x-=mod2;
return x+y;
}
struct icd
{
long double a;
int b;
};
struct ib
{
int a;
int b;
};
struct ic
{
int a, b, c, d;
};
struct ie
{
int a, b, c, d, e;
};
ll n, m, s1, s2, s4, s3, sf, k, s5, s6, mx, s7, s8, s9, mx2, res, dem2 = 0, dem = 0, s33, dem3, dem4, mid, l2, r2, center;
int i, s10, s12,k1,k2,k3,s11,limit,w,l,r,last,root;
int kk;
int el = 19;
main()
{
if(fopen(task".inp","r"))
{
fin(task);
fou(task);
}
NHP
/// cin>>s1;
///modwwe
phongbeo();
// checktime
}
vector<int> v[600001];
bool d[600001];
bitset<6000001>dp,dp2;
ic c[600001];
ib b[600001];
void dfs(int x,bool a,int y)
{
d[x]=1;
if(!a)
s3+=c[x].c;
s4+=c[x].c;
if(c[x].a==y )
{
dem++;
if(dem==2){
dem=0;
b[++dem2]= {s3,s4-s3};
return;}
}
if(!a)s2=c[x].b;
else s2=c[x].a;
for(auto f:v[s2])
if(f!=x)
dfs(f,1-a,y);
}
void phongbeo()
{
cin>>n>>m;
for(int i=1; i<=n*2; i++)
{
cin>>l>>r>>s2;
c[i]= {l,r+n,s2};
v[r+n].pb(i);
v[l].pb(i);
s5+=s2;
}
for(int i=1; i<=n*2; i++)
if(!d[i])
{
dfs(i,0,c[i].a);
s3=0;
s4=0;
}
dp.set(0);
for(int i=1;i<=dem2;i++){
dp2=(dp<<b[i].a);
dp=(dp<<b[i].b);
dp=(dp|dp2);
}
s8=s5/2;
if(s5%2==1)s8++;
s6=dp._Find_next(s8-1);
if(s6*2-s5<=m) cout<<"YES";
else cout<<"NO";
}
