I assume you want to find a minimum covering.  If $h$ is part of the input, then this problem is indeed NP-hard.  For example, if $h=1$, then each tree is a star, and the problem reduces to computing a minimum vertex cover, which is NP-hard.  I believe it should be NP-hard for any fixed $h$ as well.