Approximating min-cost chain-constrained spanning trees: a reduction from weighted to unweighted problems