Given a weighted graph and natural number k how to find the cheapest path from node s to t that can be divided by k?

Question

Given a weighted graph G=(V,E) which doesnt include negative cycles, a natural number k, and two verticles: s,t.

How can I find the cheapest route from s to t which i