Wshxzt is a lovely girl. She likes apple very much. One day HX takes her toan
apple tree. There are N nodes inthe tree. Each node has an amount of apples.
Wshxzt starts her happy trip atone node. She can eat up all the apples inthe
nodes she reaches. HX is a kind guy. He knows that eating too many can make the
lovely girl become fat. So he doesn’t allow Wshxzt to go more than K steps inthe
tree. It costs one step when she goes fromone node to another adjacent node.
Wshxzt likes apple very much. So she wants to eat as many as she can. Can you tell
how many apples she can eat inat most K steps.
Input
There are several test cases inthe input
Each test casecontainsthree parts.
The first part is two numbers N K, whose meanings we have talked about just now. We
denote the nodes by12 ... N. Since it is a tree, each node can reach any other in
only one route. (1<=N<=100, 0<=K<=200)
The second part contains N integers (All integers are nonnegative andnot bigger
than 1000). The ith number is the amount of apples in Node i.
The third part contains N-1line. There are two numbers A,B ineachline, meaning
that Node A and Node B are adjacent.
Input will be ended bytheendoffile.
Note: Wshxzt starts at Node 1.
Output
For each test case, output the maximal numbers of apples Wshxzt can eat ataline.
POJ-2486-Apple Tree-树形dp-背包思想POJ-2486-Apple Tree-树形dp-背包思想DescriptionInputOutputExamplesInputOutputProblem DescriptionSolutionCodeDescription Wshxzt is a lovely girl. She l...