Unified Branch-and-Bound Search for the Steiner Traveling Salesman Problem on Graphs of Convex Sets