
'''simple docstring'''

from itertools import count
from math import asin, pi, sqrt



def        SCREAMING_SNAKE_CASE_  (	snake_case_				:	float							)       ->	float:
 return (
     (1 - 2 * point) * sqrt(point - point**2							) + 2 * point + asin(sqrt(1 - point							)							)
 ) / 4



def        SCREAMING_SNAKE_CASE_  (	snake_case_				:	int							)       ->	float:
 SCREAMING_SNAKE_CASE  :  List[str]								=		(circles_number + 1 - sqrt(2 * circles_number							)) / (
     2 * (circles_number**2 + 1)
 )
 SCREAMING_SNAKE_CASE  :  Tuple								=		circles_number * intersection_y

 SCREAMING_SNAKE_CASE  :  int								=		intersection_x * intersection_y / 2
 SCREAMING_SNAKE_CASE  :  int								=		circle_bottom_arc_integral(
     1 / 2							) - circle_bottom_arc_integral(snake_case_							)

 return triangle_area + concave_region_area



def        SCREAMING_SNAKE_CASE_  (	snake_case_				:	float = 1 / 1000							)       ->	int:
 SCREAMING_SNAKE_CASE  :  Tuple								=		(1 - pi / 4) / 4

 for n in count(1							):
  if concave_triangle_area(snake_case_							) / l_section_area < fraction:
   return n

 return -1


if __name__ == "__main__":
   print(f"""{solution() = }""")




'''simple docstring'''

def        SCREAMING_SNAKE_CASE_  (	snake_case_				:	int   ,     snake_case_				:	list[tuple[int, int, int]]							)       ->	list[tuple[int, int, int]]:
 SCREAMING_SNAKE_CASE  :  List[Any]								=		sorted(snake_case_   ,     key=lambda snake_case_							: edge[2]							)

 SCREAMING_SNAKE_CASE  :  str								=		list(range(snake_case_							)							)

 def find_parent(snake_case_				:	Union[str, Any]							):
  if i != parent[i]:
   SCREAMING_SNAKE_CASE  :  int								=		find_parent(parent[i]							)
  return parent[i]

 SCREAMING_SNAKE_CASE  :  Union[str, Any]								=		0
 SCREAMING_SNAKE_CASE  :  Any								=		[]

 for edge in edges:
  SCREAMING_SNAKE_CASE  :  Dict								=		find_parent(edge[0]							)
  SCREAMING_SNAKE_CASE  :  Optional[int]								=		find_parent(edge[1]							)
  if parent_a != parent_b:
   minimum_spanning_tree_cost += edge[2]
   minimum_spanning_tree.append(snake_case_							)
   SCREAMING_SNAKE_CASE  :  Tuple								=		parent_b

 return minimum_spanning_tree


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

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

   kruskal(num_nodes, edges)


