A graph is uniquely geodesic if any two vertices are connected by a unique shortest path. Although an extremely natural notion, the question of which groups admit a locally finite Cayley graph with this property is still open. We show that such a group necessarily needs to be virtually free. This is joint work with M. Elder, G. Gardam, A. Piggott and K. Townsend.