Is there a direct line?

A railway network has n stations, numbered 0 to n − 1, and a list of direct lines. Each line (u, v) joins stations u and v, and trains run both ways. Return a list with one answer for each question (u, v) in queries: True if a line joins u and v directly, False if not.

edges = [(0, 1), (1, 2), (2, 3), (3, 0), (1, 3)]
direct_lines(5, edges, [(0, 1), (1, 0), (0, 2), (4, 1)])
# [True, True, False, False]

The same line may be listed more than once. No line joins a station to itself, so a question (u, u) is always False.

Limits

• Up to 200,001 stations, 200,000 lines and 200,000 questions.
• One station may have 200,000 lines. Reading through a list of its neighbours for every question is far too slow. The big tests have 3 seconds each.