Apply a level-bounded Bellman-Ford traversal to find the minimum cost trail with at most K transfers.