D. Traveling Graph
time limit per test
0.5 second
memory limit per test
64 megabytes
input
standard input
output
standard output
You are given undirected weighted graph. Find the length of the shortest cycle which starts from the vertex 1 and passes throught all the edges at least once. Graph may contain multiply edges between a pair of vertices and loops (edges from the vertex to itself).
Input
The first line of the input contains two integers n and