
"""simple docstring"""







from __future__ import annotations

import random




class 					A__			:
		A_		:			Tuple							  =      6

		def __init__( self					):
			__lowerCAmelCase     :		List[Any]		     = list(range(1			,						Dice.NUM_SIDES + 1					)					)







		def 				__lowerCamelCase				( self					):
			return random.choice(self.sides					)



def        __lowerCAmelCase							(_UpperCamelCase			,    _UpperCamelCase = 2						):
	__lowerCAmelCase     :		int		     = [Dice() for i in range(_UpperCamelCase						)]
	__lowerCAmelCase     :		Any		     = [0] * (len(_UpperCamelCase						) * Dice.NUM_SIDES + 1)
	for _ in range(_UpperCamelCase						):
		count_of_sum[sum(dice.roll() for dice in dices						)] += 1
	__lowerCAmelCase     :		str		     = [round((count * 100) / num_throws			,    2						) for count in count_of_sum]
	return probability[num_dice:]  # remove probability of sums that never appear


if __name__ == "__main__":
							import doctest

							doctest.testmod()

"""simple docstring"""







def        __lowerCAmelCase							(_UpperCamelCase			,    _UpperCamelCase						):
	__lowerCAmelCase     :		Any		     = sorted(_UpperCamelCase			,    key=lambda _UpperCamelCase						: edge[2]						)

	__lowerCAmelCase     :		Union[str, Any]		     = list(range(_UpperCamelCase						)						)

	def find_parent(_UpperCamelCase						):
		if i != parent[i]:
			__lowerCAmelCase     :		int		     = find_parent(parent[i]						)
		return parent[i]

	__lowerCAmelCase     :		Optional[Any]		     = 0
	__lowerCAmelCase     :		List[str]		     = []

	for edge in edges:
		__lowerCAmelCase     :		List[str]		     = find_parent(edge[0]						)
		__lowerCAmelCase     :		Optional[Any]		     = find_parent(edge[1]						)
		if parent_a != parent_b:
			minimum_spanning_tree_cost += edge[2]
			minimum_spanning_tree.append(_UpperCamelCase						)
			__lowerCAmelCase     :		Optional[Any]		     = parent_b

	return minimum_spanning_tree


if __name__ == "__main__":  # pragma: no cover
							lowerCamelCase__   ,		lowerCamelCase__     =						list(map(int, input().strip().split()))
							lowerCamelCase__     =						[]

							for _ in range(num_edges):
														lowerCamelCase__   ,		lowerCamelCase__   ,		lowerCamelCase__     =						(int(x) for x in input().strip().split())
														edges.append((nodea, nodea, cost))

							kruskal(num_nodes, edges)