Deepika's Flower Journey

Problem Statement

Deepika's Flower Journey Problem Description It is friendship day, and Deepika wants to give her friend Jyoti a bouquet. The bouquet needs one flower of every kind that the town's flower shops sell - if even a single kind is missing, the bouquet is incomplete. Every shop in town sells exactly one kind of flower, and several shops may sell the same kind. Some pairs of shops are joined by a road of a known length; Deepika can walk along any road in either direction as many times as she likes. Deepika starts at the shop next to her house and finishes at the shop next to Jyoti's office. Along the way she must call at a shop selling each kind of flower that exists in town. Find the smallest total road length of such a journey. Read the input from standard input and print the answer to standard output. Do not print anything else - any extra text becomes part of the output and the test will fail. Input Format The first line contains a single integer n - the number of description lines that fo