Can anyone provide a better editorial for this question . https://www.codechef.com/LTIME01/problems/GRTRIP

I have been trying to understand it for a week now, but I fail to understand how shortest path tree is being constructed and how it is compared with the dfs done by chef in his own algorithm.

Please help