Decompose the Tree

You are given an unrooted tree. There is an integer written on each node of this tree. Your task is to count the number of ways to decompose this tree to a set of paths in such a way that each node belongs to exactly one path and the sum of numbers associated with all the nodes on any of these path is always non-negative. Input The first line of input contains an integer T denoting the number