Each edge — 'i' in the graph has two values associated with it — v1[i] and v2[i].
Let M be one of the possible MST of the graph. Then define A = max(v1[i]'s for all the edges in MST) and B = max(v2[i]'s for all the edges in the MST).

Then for all the possible MSTs of this graph find the minimum value of A + B.