We consider the $k$-server problem on trees and HSTs. We give an algorithm based on Bregman projections, whose competitive ratio matches those in recent results of Bubeck et al. (STOC 2018). Joint work with Niv Buchbinder, Marco Molinaro, and Seffi Naor.