#include <bits/stdc++.h>
#include <cstdint>
using namespace std;
const int N = 3e5+5, M = 2e6;

int dfn[N], low[N], dfncnt, s[N], in_stack[N], tp;
int scc[N], sc;  // 结点 i 所在 SCC 的编号
int sz[N];       // 强连通 i 的大小

vector<int> g[N], g1[N];

void tarjan(int u) {
  low[u] = dfn[u] = ++dfncnt, s[++tp] = u, in_stack[u] = 1;
  for (auto v : g1[u]) {
    if (!dfn[v]) {
      tarjan(v);
      low[u] = min(low[u], low[v]);
    } else if (in_stack[v]) {
      low[u] = min(low[u], dfn[v]);
    }
  }
  if (dfn[u] == low[u]) {
    ++sc;
    while (s[tp] != u) {
      scc[s[tp]] = sc;
      sz[sc]++;
      in_stack[s[tp]] = 0;
      --tp;
    }
    scc[s[tp]] = sc;
    sz[sc]++;
    in_stack[s[tp]] = 0;
    --tp;
  }
}

vector<pair<int,int>> edges;
bool vis[N], v2[N];

void dfs(int u) {
    vis[u] = 1;
    for (auto v : g[u]) if (!vis[v])
        dfs(v);
}

int main() {
    cin.tie(0);
    ios::sync_with_stdio(false);
    int n, m;
    cin >> n >> m;
    for (int i = 0; i < m; ++i) {
        int u, v, t;
        cin >> u >> v >> t;
        g[u].push_back(v);
        if (t == 2) {
            g1[u].push_back(v);
            edges.push_back({u,v});
        }
    }
    for (int i = 1; i <= n; ++i) if (!dfn[i]) tarjan(i);
    dfs(1);
    for (auto [u, v] : edges) {
        if (scc[u] != scc[v]) v2[u] = 1;
    }
    bool ans = 0;
    for (int i = 1; i <= n; ++i) if (vis[i] && v2[scc[i]]) ans = 1;
    cout << (ans?"Yes":"No") << '\n';
    return 0;
}