Path Queries Problem Statement

Consider a weighted, undirected graph with 'V' vertices numbered from 1 to 'V' and 'E' bidirectional edges. You are tasked with handling 'Q' queries. For each query, you are given two integers, 'u' and 'v', representing the vertices, and you must compute the shortest distance between 'u' and 'v'. If no path exists, return -1.

Example:

Input:

V = 3, E = 3, Q = 1
Edges: (1, 2, 1), (2, 3, 1), (1, 3, 4)
Query: (1, 3)

Output:

2

Explanation:

The shortest distance from vertex 1 to vertex 3 is 2, via path 1->2->3.

Constraints:

• 1 <= T <= 5
• 1 <= V <= 100
• 1 <= E <= (V * (V - 1)) / 2
• 1 <= Q <= 105
• 1 <= u , v <= V
• 1 <= w <= 106

Note:

You do not need to print anything; it has already been handled. Implement the function to return the answer.