Heaviest CC

A simple undirected and unweighted graph with no self loops and parallel edges will be given, containing $n$ nodes and $m$ edges. Each of the nodes has a distinct index between $1$ and $n$. The number of connected components in the graph is $K$. $a_1, a_2, ..., a_k$ are $K$ numbers, where $a_i$ is the weight of the $i^{th}$ component of the graph (weight of a component is the sum of values of nod