#include <cstdio>
#include <vector>
#include <algorithm>
using namespace std;
using P=pair<int, int>;
int n, m;
int a[200020], b[200020], c[200020];
vector<P> g[100010];
bool used[400040], finish[400040], ok;
void dfs(int x, int prev){
	for(auto p:g[x]){
        int y=p.first, i=p.second;
        if(finish[i] || abs(i-prev)==n) continue;
		if(used[i]) ok=1;
		else{
            used[i]=1;
            dfs(y, i);
        }
        finish[i]=1;
	}
}
int main()
{
    scanf("%d %d", &n, &m);
	for(int i=0; i<m; i++){
		scanf("%d %d %d", &a[i], &b[i], &c[i]);
		a[i]--; b[i]--;
        g[a[i]].push_back({b[i], i});
        if(c[i]==1) g[b[i]].push_back({a[i], i+n});
	}
    for(int i=0; i<n; i++){
        dfs(i, -1);
        if(ok){
            printf("Yes\n");
            return 0;
        }
    }
    printf("No\n");
    return 0;
}