Problem Description: Suppose Mr. X live in Sylhet. You have some friends in other cities like, Dhaka, Chittagong, Cumilla, Rajshahi and Khulna. One day you realize that, you need to visit all of your friends to maintain your good relationship among all of them. But the problem is, you have very limited vacation period from your office. So, you plan to visit one by one in per day basis and always need to back in your home city. Now, your task is to help Mr. X to find out the minimum time to visit every cities. In this problem, you have given N cities and M bi-directional path, where 1 to N represent all the cities one by one (Sylhet should be always 1). M have 3 information's like starting node A, ending node B and time T. T represents the required time to go from A to B. Now, you have to show the minimum time to visit every cities N from the city 1. Output: Example: Input: 56 124 131 322 342 2 53 4.53 1 to 2 - 3 1 to 3-1 1 to 4-3 1 to 5-6