3-decomposition Conjecture

First postulated by Hoffmann-Ostenhof (approx. 2010). Prove the following conjecture: Every connected cubic graph can be decomposed into a spanning tree, a disjoint union of cycles, and a matching.