In complete graph $K_{n}$ exactly $n$ edges has weight $1$, the remaining edges have weight $2$. What is the maximum weight of MST in this graph? For which weight distributions is the maximum achieved?
Ok I think that only edges with weight $1$ will be in MST? So the answer is $n * 1$ ?