3924. Minimum Threshold Path With Limited Heavy Edges

There is an undirected weighted graph with n nodes labeled from 0 to n - 1. The graph is represented by a 2D integer array edges, where each edge edges[i] = [ui, vi, w​​​​​​​i] indicates that there is an undirected edge between nodes ui and vi with weight w​​​​​​​i. You are also given integers source, target and k. A threshold value determines whether an edge is considered light or heavy: - An