For distance spectral radius (DSR) and terminal distance spectral radius (TDSR) of tree with given sequence of vertex degrees we suggest a family of lower bounds in terms of Wiener and, respectively, terminal Wiener indices for (recently studied) vertex-weighted “Huffman” trees. For TDSR the best lower bound in the family appears to be average row sum of terminal distance matrix of BFS-tree (also known as greedy tree). Numeric simulations show that this lower bound is almost attained (error is less than 3% for TDSR and less than 6% for DSR). We make a step towards formally proving maximum error 3% for TDSR.