Mr. Kitayuta has just bought an undirected graph with n vertices and m edges. The vertices of the graph are numbered from 1 to n. Each edge, namely edge i, has a color ci, connecting vertex ai and bi.

Mr. Kitayuta wants you to process the following q queries.

In the i-th query, he gives you two integers - ui and vi.

Find the number of the colors that satisfy the following condition: the edges of that color connect vertex ui and vertex vi directly or indirectly.

Input

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

The next m lines contain space-separated three integers - ai, bi(1 ≤ ai < bi ≤ n) and ci(1 ≤ ci ≤ 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, (ai, bi, ci) ≠ (aj, bj, cj).

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

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

Output

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

Examples

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


Output

2
1
0


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


Output

1
1
1
1
2

Note

Let's consider the first sample. 

<image> 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. 
n, m = map(int, raw_input().split())
graph = []
edges = {}
vertex_edges = {}
visited = [False] * n


def dfs(u, edge):
    if (not visited[u]):
        visited[u] = True
        for i in range(len(graph)):
            vertex_1 = (min(graph[i][1], u + 1), max(graph[i][1], u + 1))
            vertex_2 = (min(graph[i][0], u + 1), max(graph[i][0], u + 1))

            if (graph[i][0] == u + 1 and vertex_1 in edges and edge in edges[vertex_1]):
                dfs(graph[i][1] - 1, edge)
            if (graph[i][1] == u + 1 and vertex_2 in edges and edge in edges[vertex_2]):
                dfs(graph[i][0] - 1, edge)


for i in range(m):
    a, b, c = map(int, raw_input().split())
    graph.append((a, b))
    vertex = (min(a, b), max(a, b))

    if (vertex in edges):
        edges[vertex].append(c)
    else:
        edges[vertex] = [c]

    if (a in vertex_edges):
        vertex_edges[a].append(c)
    else:
        vertex_edges[a] = [c]

    if (b in vertex_edges):
        vertex_edges[b].append(c)
    else:
        vertex_edges[b] = [c]

q = input()

for i in range(q):
    u, v = map(int, raw_input().split())
    count = 0

    if (u in vertex_edges):
        vertex_edges[u] = list(set(vertex_edges[u]))

        for j in vertex_edges[u]:
            visited = [False] * n
            dfs(u - 1, j)
            if (visited[v - 1]):
                count += 1

    print(count)

	 					  	 	      		 	 	   			