Help with this graph problem

[paulmcvn]

Input:
A connected graph G=(V,E), a number k (3*K<=|V|)

Problem:
Delete as small edges of G as possible such that after deleting, G has k connected-component, each component has at least 3 verticles

Please help me. Thanks