import sys
input = sys.stdin.readline


def kosaraju(edges, reverse_edges):
    import sys
    from operator import itemgetter
    sys.setrecursionlimit(10**7)
    v_count = len(edges)
    order = [0]*v_count
    k = [1]

    def get_order(v):
        order[v] = 1
        for dest in edges[v]:
            if order[dest] == 0:
                get_order(dest)
        order[v] = k[0]
        k[0] += 1

    def get_components(v):
        order[v] = 0
        return [v] + [_v for dest in reverse_edges[v] if order[dest] > 0 for _v in get_components(dest)]

    for v in range(v_count):
        if order[v] == 0:
            get_order(v)

    return [get_components(v) for v, _ in sorted(enumerate(order), key=itemgetter(1), reverse=True) if order[v] > 0]


N, M = map(int, input().split())
vi = {i: i for i in range(N)}
edges = []

for u, v, c in (map(int, input().split()) for _ in range(M)):
    u -= 1
    v -= 1
    if c == 1:
        if vi[u] == vi[v]:
            print('Yes')
            exit()
        vi[v] = vi[u]
    else:
        edges.append((u, v))

adj = [set() for _ in range(N)]
rev = [set() for _ in range(N)]
for u, v in edges:
    if vi[u] == vi[v]:
        print('Yes')
        exit()
    adj[vi[u]].add(vi[v])
    rev[vi[v]].add(vi[u])

res = kosaraju(adj, rev)
if max(len(sc) for sc in res) > 1:
    print('Yes')
else:
    print('No')