Minimum Cost to Convert String I

Given source and target strings and a set of weighted directed character transformations (possibly with multiple edges), find the minimum total cost to turn each source character into the corresponding target character by chaining allowed transforms, or return -1 if any position is unreachable. This reduces to computing shortest-path distances between letters (small fixed alphabet) and summing the per-position costs.