Translation of the meaning of the questions have been written very clearly, not here in the repeat.
Obviously tree DP, the first set of two states: \ (F [I] [0/1] \)
\ (f [i] [1 ] \) represents to \ (I \) subtree rooted in, \ (I \) nodes hold the server, and the number of all programs in the subtree to be covered.