#include <bits/stdc++.h>
using namespace std;
using LL = long long int;
#define incID(i, l, r) for(int i = (l)    ; i <  (r); ++i)
#define decID(i, l, r) for(int i = (r) - 1; i >= (l); --i)
#define incII(i, l, r) for(int i = (l)    ; i <= (r); ++i)
#define decII(i, l, r) for(int i = (r)    ; i >= (l); --i)
#define inc(i, n)  incID(i, 0, n)
#define dec(i, n)  decID(i, 0, n)
#define inc1(i, n) incII(i, 1, n)
#define dec1(i, n) decII(i, 1, n)
#define inID(v, l, r) ((l) <= (v) && (v) <  (r))
#define inII(v, l, r) ((l) <= (v) && (v) <= (r))
#define PB push_back
#define EB emplace_back
#define MP make_pair
#define FI first
#define SE second
#define FR front()
#define BA back()
#define ALL(v) v.begin(), v.end()
#define RALL(v) v.rbegin(), v.rend()
auto setmin   = [](auto & a, auto b) { return (b <  a ? a = b, true : false); };
auto setmax   = [](auto & a, auto b) { return (b >  a ? a = b, true : false); };
auto setmineq = [](auto & a, auto b) { return (b <= a ? a = b, true : false); };
auto setmaxeq = [](auto & a, auto b) { return (b >= a ? a = b, true : false); };
#define SI(v) static_cast<int>(v.size())
#define RF(e, v) for(auto & e: v)
#define until(e) while(! (e))
#define if_not(e) if(! (e))
#define ef else if
#define UR assert(false)
#define IN(T, ...) T __VA_ARGS__; IN_(__VA_ARGS__);
void IN_() { };
template<typename T, typename ... U> void IN_(T & a, U & ... b) { cin >> a; IN_(b ...); };
template<typename T> void OUT(T && a) { cout << a << endl; }
template<typename T, typename ... U> void OUT(T && a, U && ... b) { cout << a << " "; OUT(b ...); }

// ---- ----

int main() {
	auto yes = []() { OUT("Yes"); exit(0); };
	
	IN(int, n, m);
	set<pair<int, int>> se;
	vector<vector<int>> g(n);
	inc(i, m) {
		IN(int, a, b, c);
		a--; b--;
		if(se.count({ a, b }) == 1) { yes(); }
		se.emplace(a, b);
		se.emplace(b, a);
		g[a].PB(b);
		if(c == 1) { g[b].PB(a); }
	}
	
	vector<int> did(n);
	vector<bool> vis(n, false);
	function<bool(int, int)> dfs = [&](int v, int p) -> bool {
		if(did[v] == SI(g[v])) { return false; }
		if(vis[v]) { return true; }
		vis[v] = true;
		RF(e, g[v]) {
			if(e == p || e == -1) { continue; }
			if(dfs(e, v)) { return true; }
			e = -1;
			did[v]++;
		}
		vis[v] = false;
		return false;
	};
	inc(i, n) { if(dfs(i, -1)) { yes(); } }
	OUT("No");
}