Complete the function bestSumDownwardTreePath in the editor below. It must return an intege that denotes the largest sum of values along a path down the tree from any node u$.$

bestSumDownward TreePath has the following parameter$($s$)$:

parent$[$parent$[0],$ parent$[1]..$parent$[$n$-1]]$: an array of integers where each parent$[$i$]$ represents the parent node for node parent$[$i$]=-1$ means node is the root values$[$values$[0],$ values$[1].$values $1]]$: an array of integers where each values$[$i$]$ represents the value of node