You are given a bidirectional weighted graph where the weights represent latency between nodes. The goal is to travel from node 1 (src) to node n (dest) such that: Each node has an associated toll (cost) for visiting it. The total toll is defined as the sum of the toll values of all nodes visited along the path (including both source and destination). You are also given a value maxL, which represents the maximum allowed total latency for a path. Your task is to find a path with the minimum total toll such that the sum of latencies along the path is less than or equal to maxL. If there are multiple paths with the same minimum toll, any valid one can be chosen. If no such path exists, output -1.