Computer-aided synthesis planning (CASP) has made significant strides in generating retrosynthetic pathways for simple molecules in a non-constrained fashion. Recent work introduces a specialised \textit{bidirectional} search algorithm with forward and retro expansion to address the starting material-constrained synthesis problem, allowing CASP systems to provide synthesis pathways from specified starting materials, such as waste products or renewable feed-stocks. In this work, we introduce a simple guided search that allows us to solve the starting material-constrained synthesis planning problem using an existing unidirectional search algorithm, Retro. We show that by optimising a single hyperparameter, Tango outperforms existing methods in terms of efficiency and solve rate. We find that the Tango* cost function catalyses strong improvements for the bidirectional DESP methods. Our method also achieves lower wall clock times while proposing synthetic routes of similar length, a common metric for route quality.