/*
60 + 0 + 100 + 64 = 224.
*/
#include <bits/stdc++.h>
using namespace std;
#define L(i, j, k) for (int i = (j); i <= (k); i++)
#define R(i, j, k) for (int i = (j); i >= (k); i--)
//#define int long long
#define ll long long
#define pb push_back
#define pii pair<int, int>
inline int read()
{
    int sum = 0, nega = 1;
    char ch = getchar();
    while (ch > '9'||ch < '0')
    {
        if (ch == '-') nega = -1;
        ch = getchar();
    }
    while (ch <= '9' && ch >= '0') sum = sum * 10 + ch - '0', ch = getchar();
    return sum * nega;
}
const int N = 3e5 + 9, M = 2e6 + 9;
int n, m, val[N], a[N], dfn[N], tim, sta[N], col[N], co, dp[N], deg[N], top, low[N];
vector<int> G[N], T[N];
bool vis[N];
inline void tarjan(int u)
{
    dfn[u] = low[u] = ++tim; vis[u] = 1, sta[++top] = u;
    for (auto v : G[u])
    {
        if(!dfn[v]) tarjan(v), low[u] = min(low[u], low[v]);
        else if(vis[v]) low[u] = min(low[u], dfn[v]);
    }
    if(dfn[u] == low[u])
    {
        co++;
        while(sta[top] != u)
        {
            int v = sta[top];
            col[v] = co, vis[v] = 0, val[co] += a[v], top--;
        }
        col[u] = co, vis[u] = 0, val[co] += a[u], top--;
    }
    return ;
}
bool used[N];
bool mer[N];
signed main()
{
    n = read(), m = read();
    L(i, 1, n) a[i] = 1;
    L(i, 1, m)
    {
        int u = read(), v = read(), w = read();
        if(u == v && w == 2) mer[u] = 1;
        if(w == 2) G[u].pb(v);
        T[u].pb(v);
    }
    queue<int> q; q.push(1); used[1] = 1;
    while(!q.empty())
    {
    	int u = q.front(); q.pop();
    	for (auto v : T[u])
			if(!used[v]) used[v] = 1, q.push(v);
	}
    L(i, 1, n) vis[i] = 0;
    L(i, 1, n)
        if(!dfn[i]) tarjan(i);
	L(i, 1, n)
		if(used[i] && val[col[i]] == 1 && !mer[i])
		{
			puts("Yes"); return 0;
		}
	puts("No");
    return 0;
}