you give tree consist n vertice Recall tree connect undirected graph cycle Example tree vertex number 1 n all vertex weight weight vertex v a_vrecall distance vertex tree number edge simple path themYour task find subset vertice maximum total weight weight subset sum weight vertex pair vertex distance k subset