The Erdos-Stone-Simonovits Theorem implies that the Turan density of a family of graphs is the minimum of the Turn densities of the individual graphs from the family. It was conjectured by Mubayi and Rodl (J. Combin. Theory, Ser. A, submitted) that this is not necessarily true for hypergraphs, in particular for triple systems. We give an example, which shows that their conjecture is true. (C) 2002 Elsevier Science (USA).