Help — Modified Minimum Path Cover Problems for Trees
Given a Treen with n nodes and n - 1 edges, I have to answer Q queries. In every query, I get a list of nodes of size k, n1, n2, ..., nk. I need to answer the minimum number of paths that are required that cover all of these nodes.