A subgraph of an edge-coloured graph is called rainbow if all its edges have distinct colours. Our main result implies that, given any optimal colouring a sufficiently large complete K2n, there exists decomposition K2n into isomorphic spanning trees. This settles conjectures Brualdi–Hollingsworth (from 1996) and Constantine 2002) for graphs.