Decomposing the complete graph into arbitrary graph is a challenging and di cult problem in graph theory. In in this paper, we prove that the complete graph K4m+1 can be decomposed into 4m + 1 copies of an arbitrary tree with m edges and m copies of a Hamiltonian cycle whenever 4m+1 is a prime.