Decomposing Weighted Graphs

We solve the following problem: Can an undirected weighted graph G be partitioned into two nonempty induced subgraphs satisfying minimum constraints for the sum of edge weights at vertices of each subgraph? We show that this is possible for all constraints satisfying , for every vertex x , where are, respectively, the sum and maximum of incident edge weights.