B'You are given an undirected graph where each edge has one of two colors: black or red. Your task is to assign a real number to each node so that: Otherwise, if it is not possible, report that there is no feasible assignment of the numbers. The first line contains two integers N ( 1 <= q N <= q 100 ,000 ) and M ( 0 <= q M <= q 200 ,000 ): the number of nodes and the number of edges, respectively. The nodes are numbered by consecutive integers: 1, 2, ldots, N . The next M lines describe the edges. Each line contains three integers a , b and c denoting that there is an edge between nodes a and b ( 1 <= q a, b <= q N ) with color c ( 1 denotes black, 2 denotes red). If there is a solution, the first line should contain the word "YES" and the second line should contain N space-separated numbers. For each i ( 1 <= i <= N ), the i -th number should be the number assigned to the node i . Output should be such that: If there are several valid solutions, output any of them. If there is no solution, the only line should contain the word "NO". Subtasks: Note that in the second example the solution is not unique. '...