A set $S$ of vertices in a graph $G$ is called a paired-dominating set if it dominates $V$ and $\langle S\rangle $ contains at least one perfect matching. We characterize the set of vertices of a tree that are contained in all minimum paired-dominating sets of the tree.