Max Value of MST

Yash gave Swar $2$ integers $N$ and $M$, and an integer array $A$ of size $M$. Swar has to consider all undirected weighted graphs $G$ such that: - $G$ has $N$ vertices and $M$ edges - $G$ is simple, i.e, there is at most one edge between any pair of its vertices and it doesn't contain self-loops - The weights of the edges of $G$ are exactly the array $A$ Among all these graphs, Swar has to find