We show that if a subset $Ψ$ of the ends of a graph $G$ can be displayed by a tree-decomposition of finite adhesion, then it can also be displayed by a linked such tree-decomposition. This tree-decomposition captures all combinatorial information of the ends in $Ψ$: their degrees, their sets of dominating vertices, and their combined degrees.