ONE LINE python3 solution [TRIVIAL]
Trivial solution, no explanation neededCode
Trivial solution, no explanation needed

![download.jpeg](https://assets.leetcode.com/users/images/6351858c-dc48-4cbc-a473-b9eabf9472e3_1736656095.2547069.jpeg)


# Code
```python3 []
class Solution:
    def minMaxWeight(self, n: int, edges: List[List[int]], threshold: int) -> int:
        return (lambda tup: (lambda res, visited: max(res) if len(visited) == n else -1)(tup[0], tup[1]))((lambda tup: (lambda used, visited, res, q, graph: ([res, visited] + [(None, (lambda weight, a, b, blank:[[visited.update({a, b}), res.update({weight}), used.update({b:used[b] + 1})] + [heapq.heappush(q, (w2, b, n2)) for w2, n2 in graph[b] if (n2 not in visited and used[n2] < threshold)] if b not in visited else None])((lambda x:x[0])(q[0]), (lambda x:x[1])(q[0]), (lambda x:x[2])(q[0]), heapq.heappop(q)))[0] if q else None for i in range(100000)])[0:2])(defaultdict(int), set(), set(), tup[0], tup[1]))((lambda qu, graph: ([qu, graph] + [heapq.heappush(qu, (weight, 0, other_node)) for weight, other_node in graph[0]])[0:2])([], (lambda g: ([g] + [g[b].append((weight, a)) for a, b, weight in edges])[0])(defaultdict(list)))))           
```
['Python3']