Decompositions of complete or near-complete graphs into spanning trees have been widely studied, but usually in the homogeneous case, where all component trees are isomorphic. A spanning tree decomposition τ = (T 1, ..., ...