in problem tree undirecte graph connect cyclesyou give graph start tree n node label 1 n additional edge add the add edge different vertex choose 1 n edge exist the graph represent array edge length n edgesi ai bi indicate edge node ai bi graphReturn edge remove result graph tree n node if multiple answer return answer occur input Example 1input edge 121323output 23example 2input edge 1223341415output 14 Constraintsn edgeslength3 n 1000edgesilength 21 ai bi edgeslengthai biThere repeat edgesthe give graph connect