def main(): import sys input = sys.stdin.buffer.readline def yes(): print('Yes') exit() class UnionFind(): def __init__(self, n): self.n = n self.root = [-1] * (n + 1) self.rnk = [0] * (n + 1) def find_root(self, x): while self.root[x] >= 0: x = self.root[x] return x def unite(self, x, y): x = self.find_root(x) y = self.find_root(y) if x == y: return elif self.rnk[x] > self.rnk[y]: self.root[x] += self.root[y] self.root[y] = x else: self.root[y] += self.root[x] self.root[x] = y if self.rnk[x] == self.rnk[y]: self.rnk[y] += 1 def isSameGroup(self, x, y): return self.find_root(x) == self.find_root(y) def size(self, x): return -self.root[self.find_root(x)] N, M = map(int, input().split()) adj = [[] for _ in range(N+1)] edge1 = [] edge2 = [] for _ in range(M): a, b, c = map(int, input().split()) if c == 1: edge1.append((a, b)) else: edge2.append((a, b)) UF = UnionFind(N) for a, b in edge1: if UF.isSameGroup(a, b): yes() else: UF.unite(a, b) adj_new = [set() for _ in range(N+1)] adj_new_rev = [set() for _ in range(N+1)] for a, b in edge2: ar = UF.find_root(a) br = UF.find_root(b) adj_new[ar].add(br) adj_new_rev[br].add(ar) cnt = 0 st = [] in_num = [0] * (N+1) for v in range(1, N+1): if len(adj_new_rev[v]) == 0: st.append(v) else: in_num[v] = len(adj_new_rev[v]) while st: v = st.pop() cnt += 1 for u in adj_new[v]: in_num[u] -= 1 if in_num[u] == 0: st.append(u) if cnt == N: print('No') else: print('Yes') if __name__ == '__main__': main()