// 
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define debug(...) fprintf (stderr, __VA_ARGS__)

#define lep(i, l, r) for (int i = (l), i##_end = (r); i <= i##_end; ++ i)
#define rep(i, r, l) for (int i = (r), i##_end = (l); i >= i##_end; -- i)

char _c; bool _f; template <class T> inline void IN (T & x) {
	_f = 0, x = 0; while (_c = getchar (), ! isdigit (_c)) if (_c == '-') _f = 1;
	while (isdigit (_c)) x = x * 10 + _c - '0', _c = getchar (); if (_f) x = - x;
}

const int N = 3e5 + 5;

int n, m;
vector <int> to[N];

// tarjan

int tim, dfn[N], low[N], cnt, scc[N];
stack <int> stk;

void tarjan (int u) {
	dfn[u] = low[u] = ++ tim, stk.emplace ( u );
	for (auto & v : to[u]) {
		if (! dfn[v]) tarjan (v), low[u] = min (low[u], low[v]);
		else if (! scc[u]) low[u] = min (low[u], dfn[v]);
	}
	if (low[u] == dfn[u]) {
		++ cnt;
		for (int x; ; ) {
			x = stk.top (), stk.pop ();
			if (scc[x] = cnt, x == u) break ;
		}
	}
}

//

signed main () {
	IN (n), IN (m);
	vector <pair <int, int> > edge;
	for (int u, v, c, i = 1; i <= m; ++ i) {
		IN (u), IN (v), IN (c);
		if (c == 2) to[u].emplace_back ( v );
		else edge.emplace_back ( u, v );
	}
	lep (i, 1, n) if (! dfn[i]) tarjan (i);

	vector <int> out (cnt + 1);
	lep (i, 1, n) for (auto & j : to[i]) {
		if (scc[i] != scc[j]) out[scc[i]] ++ ;
	}

	for (auto & [u, v] : edge) {
		to[u].emplace_back ( v );
	}
	vector <int> vis (n + 1);
	queue <int> q;
	for ( q.emplace ( 1 ), vis[1] = true; ! q.empty (); ) {
		int u = q.front (); q.pop ();
		for (auto & v : to[u]) {
			if (! vis[v]) {
				vis[v] = true, q.emplace ( u );
			}
		}
	}

	lep (i, 1, n) if (vis[i] && out[scc[i]]) return puts ("Yes"), 0;
	return puts ("No"), 0;
}