you give connect undirected graph n vertex m edge the vertex enumerate 1 n you give n integer c1c2cn n n inclusive it guarantee parity cv equal parity degree vertex v the degree vertex number edge connect ityou write weight 2n2 2n2 inclusive edge way vertex v sum weight edge connect vertex equal cv determine impossible