#include <cstdio>
#include <iostream>
#include <string>
#include <sstream>
#include <stack>
#include <algorithm>
#include <cmath>
#include <queue>
#include <map>
#include <set>
#include <cstdlib>
#include <bitset>
#include <tuple>
#include <assert.h>
#include <deque>
#include <bitset>
#include <iomanip>
#include <limits>
#include <chrono>
#include <random>
#include <array>
#include <unordered_map>
#include <functional>
#include <complex>
#include <numeric>
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }

constexpr long long MAX = 5100000;
constexpr long long INF = 1LL << 60;
constexpr int inf = 1 << 28;
constexpr long long mod = 1000000007LL;
//constexpr long long mod = 998244353LL;

using namespace std;
typedef unsigned long long ull;
typedef long long ll;

class UnionFind {
public:
	vector<int> Parent;
	UnionFind(int N) {
		Parent = vector<int>(N, -1);
	}
	int root(int A) {
		if (Parent[A] < 0) {
			return A;
		}
		return Parent[A] = root(Parent[A]);
	}

	long long size(int A) {
		return -(long long)Parent[root(A)];
	}

	bool connect(int A, int B) {
		A = root(A);
		B = root(B);
		if (A == B) {
			return false;
		}
		if (size(A) < size(B)) {
			swap(A, B);
		}

		Parent[A] += Parent[B];
		Parent[B] = A;

		return true;
	}

};
int main()
{
	
	/*
	cin.tie(nullptr);
	ios::sync_with_stdio(false);
	*/

	int n, m; scanf("%d %d", &n, &m);
	vector<int> a(m), b(m), c(m); for (int i = 0; i < m; i++) scanf("%d %d %d", &a[i], &b[i], &c[i]), a[i]--, b[i]--, c[i]--;
	UnionFind uni(n);
	for (int i = 0; i < m; i++) {
		if (c[i]) continue;
		if (uni.root(a[i]) == uni.root(b[i])) {
			puts("Yes");
			return 0;
		}
		uni.connect(a[i], b[i]);
	}
	vector<vector<int>> g(n);
	vector<int> deg(n);
	for (int i = 0; i < m; i++) {
		if (c[i]) {
			g[uni.root(a[i])].push_back(uni.root(b[i]));
			deg[uni.root(b[i])]++;
		}
	}
	queue<int> q;
	vector<int> topo;
	for (int i = 0; i < n; i++) {
		if (deg[i] == 0) {
			q.push(i);
			topo.push_back(i);
		}
	}
	while (!q.empty()) {
		int cur = q.front();
		q.pop();
		for (int next : g[cur]) {
			deg[next]--;
			if (deg[next] == 0) {
				q.push(next);
				topo.push_back(next);
			}
		}
	}
	if (topo.size() == n) puts("No");
	else puts("Yes");
	return 0;
}