B'You are given an undirected connected graph in which any two distinct simple cycles do not have common vertices. Since the graph can be very large, it is given to you in a compressed form: for each edge, you are also given a number d , which indicates that there are d additional vertices on this edge. You need to assign a weight to each vertex and each edge of the graph -- an integer from 1 to 3 . An edge of the graph is called good if the bitwise XOR of the weights of its adjacent vertices is not equal to 0 and not equal to the weight of that edge. Similarly, a vertex of the graph is called good if the bitwise XOR of the weights of its adjacent edges is not equal to 0 and not equal to the weight of that vertex. You need to determine how many ways there are to assign weights to the vertices and edges of the graph so that all vertices and edges are good. Since the answer can be quite large, you need to calculate the remainder of the answer divided by 998 ,244 ,353 . The first line contains two integers n and m -- the number of vertices and the number of edges in the graph ( 2 <= n <= 5 cdot 10^5 , n - 1 <= m <= 10^6 ). Each of the next m lines contains three integers a_i, b_i , and d_i ( 1 <= a_i, b_i <= n , a_i ne b_i , 0 <= d_i <= 10^9 ), indicating that there is an edge in the graph connecting vertices a_i and b_i . Additionally, on this edge, there are d_i additional vertices. It is guaranteed that the given graph is connected, there are no multiple edges, loops, and any two distinct simple cycles of the graph do not have common vertices. Output a single integer -- the answer to the problem modulo 998 ,244 ,353 . In the first test, the graph is a simple cycle of 3 vertices. It can be shown, that there are exactly 12 ways to assign weights, to make all vertexes and edges good. In the second test, the graph has the f'...