Before revision:  These kind of partitioning problems are NP-hard for series-parallel graphs but can be solved in polynomial time on trees.
After revision:  These kind of partitioning problems are NP-hard in general but polynomial-time solvable on trees.