#650 · #2045 · Second Minimum Time to Reach Destination(到达目的地的第二短时间)

There are n intersections connected by bidirectional roads, each traversal taking time minutes. Traffic lights change every change minutes: green first, then red, alternating. You may only leave a node during a green light. Return the second minimum time to reach node n from node 1. Constraints: 2 <= n <= 10^4, n-1 <= edges.length <= min(2*10^4, n*(n-1)/2), 1 <= time, change <= 10^3.