The question whether every connected graph \(G\) has a spanning tree \(T\) of minimum average distance such that \(T\) is distance preserving from some vertex is answered in the negative. Moreover, it is shown that, if such a tree exists, it is not necessarily distance preserving from a median vertex.