import sys from collections import defaultdict def main(): sys.setrecursionlimit(1 << 25) N, M = map(int, sys.stdin.readline().split()) roads = [] graph = [[] for _ in range(N+1)] edge_road_ids = defaultdict(set) for i in range(M): a, b, c = map(int, sys.stdin.readline().split()) roads.append((a, b, c)) if c == 1: graph[a].append(b) edge_road_ids[(a, b)].add(i) graph[b].append(a) edge_road_ids[(b, a)].add(i) else: graph[a].append(b) edge_road_ids[(a, b)].add(i) visited = [False] * (N + 1) order = [] for u in range(1, N + 1): if not visited[u]: stack = [(u, False)] while stack: node, processed = stack.pop() if processed: order.append(node) continue if visited[node]: continue visited[node] = True stack.append((node, True)) for v in reversed(graph[node]): if not visited[v]: stack.append((v, False)) t_graph = [[] for _ in range(N + 1)] for u in range(1, N + 1): for v in graph[u]: t_graph[v].append(u) visited = [False] * (N + 1) scc_list = [] for u in reversed(order): if not visited[u]: stack = [u] visited[u] = True scc = [] while stack: node = stack.pop() scc.append(node) for v in t_graph[node]: if not visited[v]: visited[v] = True stack.append(v) scc_list.append(scc) for scc in scc_list: if len(scc) >= 3: print("Yes") return elif len(scc) == 2: u, v = scc[0], scc[1] roads_uv = edge_road_ids.get((u, v), set()) roads_vu = edge_road_ids.get((v, u), set()) total_roads = roads_uv.union(roads_vu) if len(total_roads) >= 2: print("Yes") return print("No") if __name__ == "__main__": main()