Djiskira's 
IntuitionIf I reach an edge a node , and the maximum of the path so far, or the edge connecting it to next edge is less than the maximum at the current node, th
# Intuition
If I reach an edge a node , and the maximum of the path so far, or the edge connecting it to next edge is less than the maximum at the current node, then relax. Basically Djiskira's with max edge as the min distance counter.

# Approach
<!-- Describe your approach to solving the problem. -->

# Complexity
- Time complexity:
<!-- Add your time complexity here, e.g. $$O(n)$$ -->

- Space complexity:
<!-- Add your space complexity here, e.g. $$O(n)$$ -->

# Code
```python3 []
class Solution:
    def minMaxWeight(self, n: int, edges: List[List[int]], threshold: int) -> int:

        '''
        Approach. Find all the nodes that are incident to the nodes you have currently. At first the starting node. 
        If there is a node adhacent to two of them, remove the edge with max weight
        keep track of the max distance edge in the graph

        '''
        graph = defaultdict(list)
        for u, v, w in edges:
            graph[v] += [(u, w)]
        heap = [(0, 0)]

        maximum = [float('inf')] * n
        maximum[0] = 0
        to_return = 0

        while heap:
            weight, node = heapq.heappop(heap)
            if weight > maximum[node]:
                continue
            for node_, weight_ in graph[node]:
                new_max = max(maximum[node], weight_)
                if new_max < maximum[node_]:
                    maximum[node_] = new_max
                    heapq.heappush(heap, (new_max, node_))

        returning = max(maximum[1:])

        return returning if returning != float('inf') else -1
```
['Python3']