CF21D Traveling Graph

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).

The first line of the input contains two integers $ n $ and $ m $ ( $ 1

Output minimal cycle length or -1 if it doesn't exists.