I have to solve this using dynamic programming. This problem is more famously known as “Weight constrained shortest path problem”.
If you take a look at section 3.1 of this article https://web.stanford.edu/~shushman/math15_report.pdf it talks about a Label Setting algo, can you please take a look at this question.
