Graph G and shortest path on each vertexes was given, what is the order of edge?

Question

Consider connected and undirected Graph G.

shortest path tree for each vertexes of G was given.

if we makes union of all these shorte