#include <bits/stdc++.h>
using namespace std;

#define all(x) begin(x), end(x)
#ifdef CKISEKI
#define safe cerr << __PRETTY_FUNCTION__ << " line " << __LINE__ << " safe\n"
#define debug(a...) debug_(#a, a)
#define orange(a...) orange_(#a, a)
template <typename ...T>
void debug_(const char *s, T ...a) {
    cerr << "\e[1;32m(" << s << ") = (";
    int cnt = sizeof...(T);
    (..., (cerr << a << (--cnt ? ", " : ")\e[0m\n")));
}
template <typename I>
void orange_(const char *s, I L, I R) {
    cerr << "\e[1;32m[ " << s << " ] = [ ";
    for (int f = 0; L != R; ++L)
        cerr << (f++ ? ", " : "") << *L;
    cerr << " ]\e[0m\n";
}
#else
#define safe ((void)0)
#define debug(...) safe
#define orange(...) safe
#endif

class SCC {
    int n, sccnt;
    vector<vector<int>> G, rG;
    vector<int> ord, vis, idx;
    void dfs(int u) {
        vis[u] = true;
        for (int v: G[u])
            if (not vis[v])
                dfs(v);
        ord.push_back(u);
    }
    void rdfs(int u) {
        vis[u] = false;
        idx[u] = sccnt;
        for (int v : rG[u])
            if (vis[v])
                rdfs(v);
    }
public:
    SCC(int n_) : n(n_), sccnt(0), G(n), rG(n), vis(n), idx(n) {}
    void add_edge(int u, int v) {
        G[u].push_back(v);
        rG[v].push_back(u);
    }
    void solve() {
        for (int i = 0; i < n; ++i)
            if (not vis[i])
                dfs(i);
        reverse(ord.begin(), ord.end());
        for (int u : ord) {
            if (vis[u]) {
                rdfs(u);
                sccnt++;
            }
        }
    }
    int get(int x) const { return idx[x]; }
};

int main() {
    cin.tie(nullptr)->sync_with_stdio(false);
    int n, m;
    cin >> n >> m;
    vector<vector<int>> g(n);
    SCC scc2(n);
    vector<pair<int, int>> e;
    for (int i = 0; i < m; ++i) {
        int u, v, o;
        cin >> u >> v >> o;
        --u, --v;
        g[u].push_back(v);
        if (o == 2) {   
            scc2.add_edge(u, v);
            e.emplace_back(u, v);
        }
    }
    scc2.solve();
    vector<bool> vis(n);
    vector<int> a;
    auto dfs = [&](auto self, int u) -> void {
        if (vis[u])
            return;
        vis[u] = true;
        a.push_back(u);
        for (int v : g[u])
            self(self, v);
    };
    dfs(dfs, 0);
    vector<int> cnt(n), od(n);
    for (auto [u, v] : e) {
        int x = scc2.get(u);
        int y = scc2.get(v);
        if (x == y)
            cnt[x]++;
        od[x]++;
    }
    bool ans = false;
    for (int x : a) {
        x = scc2.get(x);
        ans |= (cnt[x] == 0) and (od[x] != 0);
    }
    cout << (ans ? "Yes" : "No") << '\n';
    return 0;
}