Saving edge with min and max weight in a strongly connected component and reconstructing the condensed tree in Tarjan's algorithm

Question

for some problem that I\'m solving I need to find the strongly connected components of a directed and weighted graph. After finding this components I need to condense the gr