Extremal problems for colourings of uniform hypergraphs