from sys import stdin
input=lambda :stdin.readline()[:-1]

def SCC(n,edge):
  res,S,P=[],[],[]
  Q,state=list(range(n)),[0]*n
  while Q:
    v=Q.pop()
    if v<0:
      d=state[~v]-1
      if P[-1]>d:
        res.append(S[d:])
        del S[d:]
        P.pop()
        for u in res[-1]:
          state[u]=-1
    elif state[v]>0:
      while P[-1]>state[v]:
        P.pop()
    elif state[v]==0:
      S.append(v)
      P.append(len(S))
      state[v]=len(S)
      Q.append(~v)
      Q.extend(edge[v])
  return res[::-1]

n,m=map(int,input().split())
edge0=[[] for i in range(n)]
edge1=[[] for i in range(n)]
for i in range(m):
  a,b,t=map(lambda x:int(x)-1,input().split())
  if t==0:
    edge0[a].append(b)
  else:
    edge1[a].append(b)

G=SCC(n,edge1)
grp=[0]*n
for i in range(len(G)):
  for v in G[i]:
    grp[v]=i

todo=[0]
seen=[0]*n
seen[0]=1
while todo:
  v=todo.pop()
  for u in edge0[v]:
    if seen[u]==0:
      seen[u]=1
      todo.append(u)
      
  for u in edge1[v]:
    if grp[u]!=grp[v]:
      print('Yes')
      exit()
    if seen[u]==0:
      seen[u]=1
      todo.append(u)

print('No')