




from ..utils import DummyObject, requires_backends






class 			A			(		metaclass=_lowerCAmelCase		):
     """simple docstring"""

     _snake_case:	Optional[Any]     =["torch", "transformers", "k_diffusion"]




     def __init__(    self  :   Optional[Any]	,  *A__  :   Dict	,  **A__  :   Dict			)				->       Any:
           requires_backends(self	,  ['torch', 'transformers', 'k_diffusion']			)




     @classmethod
     def  __snake_case   (    cls  :   str	,  *A__  :   List[str]	,  **A__  :   List[Any]			)				->       List[str]:
           requires_backends(cls	,  ['torch', 'transformers', 'k_diffusion']			)




     @classmethod
     def  __snake_case   (    cls  :   Dict	,  *A__  :   List[str]	,  **A__  :   Union[str, Any]			)				->       List[Any]:
           requires_backends(cls	,  ['torch', 'transformers', 'k_diffusion']			)





def 			lowerCAmelCase_			(  lowerCamelCase:       int     ,				lowerCamelCase:       list[tuple[int, int, int]]						)					->			list[tuple[int, int, int]]:


      '''simple docstring'''




      lowerCamelCase__        =				sorted(lowerCamelCase     ,				key=lambda lowerCamelCase						: edge[2]						)

      lowerCamelCase__        =				list(range(lowerCamelCase						)						)

      def find_parent(lowerCamelCase:       int						):
            if i != parent[i]:
                  lowerCamelCase__        =				find_parent(parent[i]						)
            return parent[i]

      lowerCamelCase__        =				0
      lowerCamelCase__        =				[]

      for edge in edges:
            lowerCamelCase__        =				find_parent(edge[0]						)
            lowerCamelCase__        =				find_parent(edge[1]						)
            if parent_a != parent_b:
                  minimum_spanning_tree_cost += edge[2]
                  minimum_spanning_tree.append(lowerCamelCase						)
                  lowerCamelCase__        =				parent_b

      return minimum_spanning_tree


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

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

      kruskal(num_nodes, edges)