Given there are cities , and each city has a fun factor associated with it . There is a bidirectional path between cities . Calculate the max total fun by choosing only 4 cities and show the list of cities .

Eg :
Fun factors
LA- 10000
CH- 1000
Del- 5
Iowa- 200
Mum-50000

Paths-
LA - CH
Ch-Iowa
Del-Iowa
Del-mum

O\p - mum,del,iowa,ch : 51205