#include <bits/stdc++.h>
#define ff first
#define ss second
using namespace std;
const int maxn = 6e4+10;
typedef pair<int, int> pii;
int n, k;
int sa, sb;
int pai[maxn], edge[maxn];
int firstCycle[maxn], lastCycle[maxn], inCycle[maxn];
int comp[maxn], back[maxn];
int freq[20*maxn];
bool dp[20*maxn];
bool mark[maxn];
vector<int> V;
vector<pii> grafo[maxn];
int msb(int x)
{
return 31-__builtin_clz(x);
}
void dfs(int u, int p, int cc)
{
comp[u] = cc;
for (auto pp: grafo[u])
{
int v = pp.ff, w = pp.ss;
if (comp[v])
{
if (v != p)
{
firstCycle[cc] = u, lastCycle[cc] = v;
back[cc] = w;
}
continue;
}
pai[v] = u, edge[v] = w;
dfs(v, u, cc);
}
}
void markCycle(int cc)
{
int u = firstCycle[cc], v = lastCycle[cc];
int s0 = 0, s1 = back[cc];
bool turn = 0;
while (true)
{
inCycle[v] = true;
if (!turn) s0 += edge[v];
else s1 += edge[v];
if (u == v) break;
v = pai[v];
turn = !turn;
}
if (s0 > s1)
++freq[s0], ++freq[s0-s1];
else
++freq[s1], ++freq[s1-s0];
}
void dfs2(int u)
{
mark[u] = true;
for (auto pp: grafo[u])
{
int v = pp.ff;
if (!mark[v])
dfs2(v);
}
if (!inCycle[u])
{
if (u <= n) sa += edge[u];
else sb += edge[u];
}
}
int main(void)
{
memset(firstCycle, -1, sizeof firstCycle);
scanf("%d %d", &n, &k);
int S = 0;
for (int i = 1; i <= 2*n; i++)
{
int a, b, w;
scanf("%d %d %d", &a, &b, &w);
b += n;
S += w;
grafo[a].push_back({b, w});
grafo[b].push_back({a, w});
}
int cc = 0;
for (int i = 1; i <= 2*n; i++)
{
if (comp[i]) continue;
dfs(i, 0, ++cc);
if (firstCycle[cc] == -1)
{
printf("NO\n");
return 0;
}
}
for (int i = 1; i <= cc; i++)
{
markCycle(i);
dfs2(firstCycle[i]);
}
for (int i = 0; i <= S; i++)
{
if (freq[i] == 0) continue;
int x = msb(freq[i]);
for (int j = 0; j < x; j++)
V.push_back((1<<j)*i);
V.push_back(i*(freq[i]-(1<<x)+1));
}
// solve a
dp[0] = 1;
for (auto w: V)
for (int i = (S-2*sa)/2; i >= w; i--)
dp[i] |= dp[i-w];
int mx = 0;
for (int i = 0; i <= (S-2*sa)/2; i++)
if (dp[i])
mx = max(mx, i);
if (S-sb-2*sa-2*mx <= k)
{
printf("YES\n");
return 0;
}
memset(dp, 0, sizeof dp);
// solve b
dp[0] = 1;
for (auto w: V)
for (int i = (S-2*sb)/2; i >= w; i--)
dp[i] |= dp[i-w];
mx = 0;
for (int i = 0; i <= (S-2*sb)/2; i++)
if (dp[i])
mx = max(mx, i);
if (S-sa-2*sb-2*mx <= k)
{
printf("YES\n");
return 0;
}
printf("NO\n");
}
