What's the purpose of Karger's algorithm?
Even in an unweighted graph, your suggested algorithm doesn't work:  take a graph of 6 vertices with triangle a, b, c, and triangle d, e, f, with an edge between c and d.  Vertices a, b, e, and f each have minimal degrees of 2, but cutting the graph between the two triangles gives a cut of 1.