Apple tree

Submit

Language is selected by the extension of the file. See the list of supported languages to know the extension of your language.

Problem

A wants to pick apples from a tree with n apples(numbered from 1 to n). The ith apple's weight is the ith element of w. The largest weight that A can handle is m. Also, he wishes that the apples picked is a connected graph.

A wants to take as many apples as possible. Please help him find out the maximum number of apples possible to be taken by him.

n and m are inputted on the first line. They represent the weight of the apples on the tree and the maximum weight that A can handle.

The second line contains n integers, where the ith integer represents the ith element of w.

In the following n-1 lines, the ith element of u and v are inputted on each line. They represent that the ith element of u and v are on the same branch.

Output an integer in a line, which shows the maximum number of apples that A can take.

Options

exec is denied

rejudge feature is enabled

now post-mortem time, all source codes will be revealed

Sample input:_

5 8
5 2 3 4 1
1 2
1 3
2 4
2 5

Sample output:

3

Ranking

Ruby _

Ruby2 _

Python _

Python3 _

PHP _

Scheme _

Common LISP _

Arc _

Clojure _

Io _

JavaScript _

Tcl _

Xtal _

Crystal _

Kite _

REXX _

PARI/GP _

Squirrel _

Forth _

BASIC _

Perl6 _

A+ _

K _

Jelly _

C _

Go _

Rust _

Java _

Chapel _

Maxima _

gnuplot _

Octave _

Euphoria _

AWK _

sed _

jq _

Bash _

Bash (builtins) _

Zsh _

Fish _

bc _

dc _

m4 _

Postscript _

R _

Brainfuck _

Befunge _

Befunge-98 _

Pefunge _

Labyrinth _

Hexagony _

><> _

Minus _

GolfScript _

gs2 _

FlogScript _

Burlesque _

FerNANDo _

Unlambda _

z80 _

DOS _

Vim _

goruby _

Scala _

Language Ranking_

return to the top page