Given n cities and a list of weighted edges between them, find the minimum cost to connect all cities such that there is a path between every pair of cities, or return -1 if it is impossible.