Destroying Bridges Part 2

There are $N$ islands, numbered $1$ to $N$. Initially, every pair of islands is connected by a bridge. Hence, there are a total of $\frac{N \cdot (N - 1)}{2}$ bridges. The importance of the $i^{th}$ island is $A_i$. Everule lives on island $1$ and enjoys visiting the other islands using bridges. The cost of destroying the bridge between island $i$ and $j$ is $A_i \cdot A_j$. Dominater has the