E0. Who can win the max leaf?

Easy version of E. Deconstruction Tree. Solve this first to classify which vertices can appear in some achievable set, then continue to the full counting problem.