#include<bits/stdc++.h>
using namespace std;
#define fs first
#define sc second
#define pb push_back
#define mp make_pair
#define eb emplace_back
#define ALL(A) A.begin(),A.end()
#define RALL(A) A.rbegin(),A.rend()
typedef long long LL;
typedef pair<LL,LL> P;
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; }
template<typename T> T gcd(T a,T b){return b?gcd(b,a%b):a;}
const LL mod=1000000007;
const LL LINF=1LL<<62;
const int INF=1<<30;
int dx[]={1,0,-1,0,1,-1,1,-1};
int dy[]={0,1,0,-1,1,-1,-1,1};

vector<int> G[1<<17];
vector<int> vis(1<<17,0);

bool dfs(int u,int v,int s){
    if(vis[u] == s + 1){
        if(u == v) return false;
        else return true;
    }
    vis[u] = s + 1;
    for(auto g:G[u]){
        if(g == v) continue;
        if(dfs(g, u, s)) return true;
    }
    return false;
}


int main(){
    int n,m;cin >> n >> m;
    for (int i = 0; i < m; i++) {
        int x,y,c;cin >> x >> y >> c;
        x--,y--;
        if(c == 1){
            G[x].pb(y);
            G[y].pb(x);
        }
        else{
            G[x].pb(y);
        }
    }
    bool ans = false;
    for (int i = 0; i < n; i++) {
        ans |= dfs(i,i,i);
    }
    if(ans) puts("Yes");
    else puts("No");
    return 0;
}