from collections import deque

class Unionfind:
     
    def __init__(self,n):
        self.uf = [-1]*n
 
    def find(self,x):
        if self.uf[x] < 0:
            return x
        else:
            self.uf[x] = self.find(self.uf[x])
            return self.uf[x]
 
    def same(self,x,y):
        return self.find(x) == self.find(y)
 
    def union(self,x,y):
        x = self.find(x)
        y = self.find(y)
        if x == y:
            return False
        if self.uf[x] > self.uf[y]:
            x,y = y,x
        self.uf[x] += self.uf[y]
        self.uf[y] = x
        return True
 
    def size(self,x):
        x = self.find(x)
        return -self.uf[x]

n,m = map(int,input().split())
R = [[int(x)-1 for x in input().split()] for i in range(m)]
uf = Unionfind(n)
for a,b,c in R:
    if c == 0:
        if uf.same(a,b):
            print("Yes")
            exit()
        uf.union(a,b)

e = [[] for i in range(n)]
out = [0]*n
for a,b,c in R:
    if c:
        e[uf.find(b)].append(uf.find(a))
        out[uf.find(a)] += 1
q = deque([])
for i in range(n):
    if out[i]:
        continue
    q.append(i)

while q:
    now = q.popleft()
    for nex in e[now]:
        out[nex] -= 1
        if out[nex] == 0:
            q.append(nex)
print("Yes" if sum(out) else "No")