Tutorial contribution request for problem LOJ-1101 – A Secret Mission

I would like to contribute a tutorial for LOJ-1101 – A Secret Mission.

I solved the problem using a Minimum Spanning Tree (Prim’s Algorithm) combined with LCA using Binary Lifting, and I would like to write a tutorial explaining this approach in English.
