Meaning of the questions:
Given there are n points m1 to explore military bases, each of the bases has two entrances u, v (u, v point belongs 1-n1) once they reach a doorway (1-n1) connected thereto can explore all the entrances and exits, and asked the price of the least explored all the entrances and exits
and m have the edges, forming the DAG, each edge has two attributes s, t, s path through the consideration of the properties of all edges and / t and properties. Starting at the point n.
answer: