{"trustable":false,"sections":[{"title":"","value":{"format":"HTML","content":"\n \u003cdiv class\u003d\"ptx\" lang\u003d\"en-US\"\u003e\n 给定一棵树,树上有N个节点,每个节点对应一个质量为wi的苹果(又 ** 是苹果,每到题都有苹果, *** ),老板要求摘了某个苹果后,不能摘他父节点处的苹果,摘错苹果不给钱,最后还要按苹果总质量给工钱。(这老板有毒)\n \u003c/div\u003e"}},{"title":"Input","value":{"format":"HTML","content":"\n \u003cdiv class\u003d\"ptx\" lang\u003d\"en-US\"\u003e\n 结点从1-N编号\n第一行为N(1 \u0026lt;\u003d N \u0026lt;\u003d 6 000) ,代表结点的个数\n接下来N行分别代表每个结点上苹果的质量(从-128到127克不等)(负质量苹果我也是够了)\n接下来N-1行,每行两个数L, K,代表K是L的一个父节点\n输入有多组,以0 0结束\n \u003c/div\u003e"}},{"title":"Output","value":{"format":"HTML","content":"\n \u003cdiv class\u003d\"ptx\" lang\u003d\"en-US\"\u003e\n每组数据一行,每行输出一个整数\n代表所选苹果质量和的最大值\n \u003c/div\u003e"}},{"title":"输入样例","value":{"format":"HTML","content":"\u003cpre class\u003d\"sio\"\u003e7\n1\n1\n1\n1\n1\n1\n1\n1 3\n7 4\n2 3\n4 5\n6 4\n3 5\n0 0\n\u003c/pre\u003e"}},{"title":"输出样例","value":{"format":"HTML","content":"\u003cpre class\u003d\"sio\"\u003e5\u003c/pre\u003e"}},{"title":"Hint","value":{"format":"HTML","content":"这题是从某高中的Group里淘来的,我还没做过,新鲜热乎。\n结束条件注意\n本题仅表示对easy吃鸡的祝贺,如果造成误伤纯属巧合\n某easy记得补题!某easy记得补题!某easy记得补题!\n如果题解出的晚,就怪我学的慢,毕竟数位我也搞了好几天"}}]}