Minimum Score After Removals on a Tree

Minimum Score After Removals on a Tree: There is an undirected connected tree with n nodes labeled from 0 to n – 1 and n – 1 edges. You are given a 0-indexed integer array nums of length n where nums[i] represents the value of the ith node. You are also given a 2D integer array edges of length n -…