You store the original tree ( space for adjacency lists) and the decomposition tree ( space for parent pointers). Distance arrays during DFS use space. If you store distances from every centroid to all nodes (for distance queries), that is space because each node appears in centroid subtrees.
For most problems, space is acceptable with modern memory limits. If space is tight, recompute distances on-the-fly instead of storing them.