There is an undirected graph with n nodes labeled from $0$ to n $- 1$. You are given a $2$D integer array edges where edges[i] $= [$ u_i, v_i, length_i $]$ represents a bidirectional edge between node u_i and node v_i that takes length_i units of time to traverse.

You are also given an integer array disappear of length n, where disappear[i] represents the time at which node i disappears from the graph. Once a node disappears, it cannot be visited or traversed.

Starting at node $0$ at time $0$, determine the minimum time needed to reach each node.

Return an array answer of size n, where answer[i] is the minimum time required to visit node i, or $-1$ if node i cannot be visited before it disappears.

Constraints:

• $1 \leq$ n $\leq 5 \times 10^4$

• $0 \leq$ edges.length $\leq 10^5$

• edges[i] $= [$ u_i, v_i, length_i $]$

• $0 \leq$ u_i, v_i $\leq$ n $- 1$

• $1 \leq$ length_i $\leq 10^5$

• disappear.length $=$ n

• $1 \leq$ disappear[i] $\leq 10^5$

Now, let’s take a moment to make sure you’ve correctly understood the problem. The quiz below helps you check if you’re solving the correct problem:

We have a game for you to play. Rearrange the logical building blocks to develop a clearer understanding of how to solve this problem.

Implement your solution in the following coding playground.