> but for this test my program show 60 (i thing that 70 is
> OK)
> 5 2
> 1 2 10
> 2 3 50
> 1 4 30
> 4 5 40

THIS is a VERY GOOD example, showing that greedy algorithm
is not working!

Tests updated, problem unlocked.

Thank you all for support and espexially toPavel Aksonov.

> > 5 2
> > 1 2 10
> > 2 3 50
> > 1 4 30
> > 4 5 40
>
> THIS is a VERY GOOD example, showing that greedy algorithm
> is not working!
>
> Tests updated, problem unlocked.


The quote from the problem definition:
"...You're right, it looks just like a binary tree, i.e.
any biparous branch splits up to exactly two new branches."

But the given tree's branches 1-2 and 1-4 DO NOT split into
two new branches, thus it CAN NOT occur in the tests!