The roads of Cubiconia are in a dire state, after years of neglect and lack of maintenance. Each road connects two different cities $A$ and $B$ and can be traveled in both ways (from $A$ to $B$ or from $B$ to $A$). There is at most one road between each pair of cities, and using the existing roads it is possible to travel between any pair of cities. The new emperor of Cubiconia has just raised the taxes (again!), but promised to repair at least some of the roads, guaranteeing that Cubiconians will be able to travel between any pair of cities using only restored roads.

The Department of Public Works have calculated the cost of repairing each individual road. Now they want to calculate the minimum cost for repairing a set of roads so that the emperor’s promise is made true. This is not easy because the emperor wants the set of repaired roads to include one particular road, but he has not yet decided which particular road to include: could be the one that connects the city where his castle is to the city where his daughter’s royal residence is, or the road that connects the city where his summer palace is to the only city by the seaside, or... Fearing the emperor will take too long to decide, the engineers want your help.

Given the description of the roads in Cubiconia, with their respective repairing costs, you must write a program to answer a set of queries. For each query you will be given one specific road that should be repaired, and must determine the minimum cost for repairing a set of roads (including the given specific road) so that Cubiconians will be able to travel between any pair of cities using only restored roads.

The first line contains two integers $N$ ($2 \leq N \leq 10^5$) and $R$ ($N - 1 \leq R \leq 2 \times 10^5$), representing respectively the number of cities and the number of roads in Cubiconia. Cities are identified by distinct integers from $1$ to $N$. Each of the next $R$ lines describes a road with three integers $A$, $B$ $(1 \leq A \lt B \leq N)$ and $C$ $(1 \leq C \leq 10^4)$, indicating that there is a road between cities $A$ and $B$ and the cost of repairing it is $C$. There is at most one road between each pair of cities, and using the existing roads it is possible to travel between any pair of cities. The next line contains an integer $Q$ $(1 \leq Q \leq 10^5)$ representing the number of queries. Each of the next $Q$ lines describes a query with two integers $U$ and $V$ $(1 \leq U \lt V \leq N)$, indicating the specific road that should be repaired. There are no repeated queries.

Output $Q$ lines, each line with an integer indicating the answer to the corresponding query of the input, that is, the minimum cost for repairing a set of roads (including the specific road in the query) so that Cubiconians will be able to travel between any pair of cities using only restored roads.

Input

3 3
1 2 10
2 3 5
1 3 7
3
2 3
1 2
1 3

Output

12
15
12

Input

4 4
1 2 1
2 4 1
2 3 100
1 4 50
1
1 4

Output

151

Input

5 7
1 2 8
1 3 10
2 4 5
2 3 12
4 5 4
3 5 14
1 5 20
3
2 3
1 5
3 5

Output

29
39
31