Abstract. We show that among all graphs on n vertices which have p\ge 2 blocks, the maximum Wiener index is attained by a graph composed of two cycles joined by a path. (We admit that one or both cycles can be replaced by a single edge.) In a subsequent paper we specify the lengths of the cycles for given n and p.