Mr. Kitayuta's Colorful Graph

Description:

Input:

The first line of the input contains space-separated two integers - n and m(2 ≤ n ≤ 10⁵, 1 ≤ m ≤ 10⁵), denoting the number of the vertices and the number of the edges, respectively.

The next m lines contain space-separated three integers - a_i, b_i(1 ≤ a_i < b_i ≤ n) and c_i(1 ≤ c_i ≤ m). Note that there can be multiple edges between two vertices. However, there are no multiple edges of the same color between two vertices, that is, if i ≠ j, (a_i, b_i, c_i) ≠ (a_j, b_j, c_j).

The next line contains a integer- q(1 ≤ q ≤ 10⁵), denoting the number of the queries.

Then follows q lines, containing space-separated two integers - u_i and v_i(1 ≤ u_i, v_i ≤ n). It is guaranteed that u_i ≠ v_i.

Output:

For each query, print the answer in a separate line.

Sample Input:

4 5
1 2 1
1 2 2
2 3 1
2 3 3
2 4 3
3
1 2
3 4
1 4

Sample Output:

2
1
0

Sample Input:

5 7
1 5 1
2 5 1
3 5 1
4 5 1
1 2 2
2 3 2
3 4 2
5
1 5
5 1
2 5
1 5
1 4

Sample Output:

1
1
1
1
2

Note:

Let's consider the first sample.

The figure above shows the first sample.

• Vertex 1 and vertex 2 are connected by color 1 and 2.
• Vertex 3 and vertex 4 are connected by color 3.
• Vertex 1 and vertex 4 are not connected by any single color.