Https://dunjudge.me/analysis/problems/346/

https://dunjudge.me/analysis/problems/346/
What I can understand is, out of all the paths we have to find a path such that the pebble with greatest value of that path is the smallest of the greatest pebbles of all paths… How do I do this? I have thought about it for a long time but can’t figure out the dp.