2872. Maximum Number of K-Divisible Components

Given a tree of n vertices, values values, and a number k (the total of all values is guaranteed divisible by k). Find the maximum number of components the tree can be cut into (by removing edges) so…