 Practice
Resources
Contests
Online IDE
New
Free Mock
Events New Scaler
Practice
Improve your coding skills with our resources
Contests
Compete in popular contests with top coders Events
Attend free live masterclass hosted by top tech professionals
New
Scaler
Explore Offerings by SCALER # Delete Edge!

Problem Description

Given an undirected tree with N nodes labeled from 1 to N.

Each node has a certain weight assigned to it given by an integer array A of size N.

You need to delete an edge in such a way that the Product between the sum of weights of nodes in one subtree with the sum of weights of nodes in other subtree is maximized.

Return this maximum possible product modulo 109 + 7.

NOTE:

• The tree is rooted at a node labeled with 1.
• You need to return the maximum possible product, then take its mod.

Problem Constraints

2 <= N <= 105

1 <= A[i] <= 103

Input Format

First argument is an integer array A of size N denoting the weight of each node.

Second argument is a 2-D array B of size (N-1) x 2 denoting the edge of the tree.

Output Format

Return a single integer denoting the maximum product prossible of sum of weights of nodes in the two subtrees formed by deleting an edge with modulo 109 + 7.

Example Input

Input 1:

``` A = [10, 5, 12, 6]
B = [
[1, 2]
[1, 4]
[4, 3]
]
```

Input 2:

``` A = [11, 12]
B = [
[1, 2]
]
```

Example Output

Output 1:

` 270`

Output 2:

``` 132
```

Example Explanation

Explanation 1:

``` Removing edge (1, 4) created two subtrees.
Subtree-1 contains nodes (1, 2) and Subtree-2 contains nodes (3, 4)
So product will be = (A + A) * (A + A) = 15 * 18 = 270
```

Explanation 2:

``` Removing edge (1, 2) created two subtrees.
Subtree-1 contains node (1) and Subtree-2 contains node (3)
So product will be = (A) * (A) = 11 * 12 = 132
```

NOTE: You only need to implement the given function. Do not read input, instead use the arguments to the function. Do not print the output, instead return values as specified. Still have a question? Checkout Sample Codes for more details. Hints
• Hint 1
• Solution Approach
• Complete Solution

## Discussion Free Mock Assessment
Fill up the details for personalised experience.
Phone Number *
OTP will be sent to this number for verification
+1 *
+1
Change Number
1993
1994
1995
1996
1997
1998
1999
2000
2001
2002
2003
2004
2005
2006
2007
2008
2009
2010
2011
2012
2013
2014
2015
2016
2017
2018
2019
2020
2021
2022
2023
2024
2025
2026
2027
2028
*Enter the expected year of graduation if you're student
Current Employer
Company Name
College/University Name
Job Title
Job Title
Software Development Engineer (Backend)
Software Development Engineer (Frontend)
Software Development Engineer (Full Stack)
Data Scientist
Android Engineer
iOS Engineer
Devops Engineer
Support Engineer
Research Engineer
Engineering Intern
QA Engineer
Co-founder
SDET
Product Manager
Product Designer
Backend Architect
Program Manager
Release Engineer 