#include <vector>
#include <iostream>
using namespace std;
int V, E; vector<int> G[100009], rG[100009], vs; bool used[100009]; int cmp[100009];
void add_edge(int from, int to) {
	G[from].push_back(to);
	rG[to].push_back(from);
}
void dfs(int v) {
	used[v] = true;
	for (int i = 0; i < G[v].size(); i++) {
		if (!used[G[v][i]]) dfs(G[v][i]);
	}
	vs.push_back(v);
}
void rdfs(int v, int k) {
	used[v] = true;
	cmp[v] = k;
	for (int i = 0; i < rG[v].size(); i++) {
		if (!used[rG[v][i]]) rdfs(rG[v][i], k);
	}
}
int scc() {
	fill(used, used + V, false);
	vs.clear();
	for (int v = 0; v < V; v++) {
		if (!used[v]) dfs(v);
	}
	fill(used, used + V, false);
	int k = 0;
	for (int i = vs.size() - 1; i >= 0; i--) {
		if (!used[vs[i]]) rdfs(vs[i], k++);
	}
	return k;
}
int main() {
	cin >> V >> E;
	vector<pair<int, int> > edges;
	for (int i = 0; i < E; ++i) {
		int a, b, c;
		cin >> a >> b >> c; --a, --b;
		add_edge(a, b);
		if (c == 1) add_edge(b, a);
		edges.push_back(make_pair(a, b));
	}
	int z = scc();
	vector<int> d(z), c(z);
	for (int i = 0; i < V; ++i) {
		++c[cmp[i]];
	}
	for (pair<int, int> e : edges) {
		if (cmp[e.first] == cmp[e.second]) {
			++d[cmp[e.first]];
		}
	}
	bool ok = false;
	for (int i = 0; i < z; ++i) {
		if (d[i] >= c[i] && c[i] >= 2) ok = true;
	}
	cout << (ok ? "Yes" : "No") << endl;
	return 0;
}