Mr. Kitayuta has just bought an undirected graph consisting of 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 ≤ 100, 1 ≤ m ≤ 100), 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 ≤ 100), 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. 
2 1
1 2 1
1
1 2
 2 3
1 2 3
1 2 2
1 2 1
1
1 2
 2 5
1 2 1
1 2 2
1 2 3
1 2 4
1 2 5
1
1 2

1
 3
 5

def dfs(vertice, cor, adjacencias, visitados):
    if visitados[vertice] != 1:
            visitados[vertice] = 1
            for aresta in adjacencias[str(vertice)]:
                if aresta[1] == cor:
                    dfs(int(aresta[0]), cor, adjacencias, visitados)


entrada = input().split()
n = int(entrada[0])
m = int(entrada[1])
adjacencias = {}

i = 1
while i <= n:
    adjacencias[str(i)] = []
    i += 1

i = 0
while i < m:
    aresta = input().split()
    adjacencias[aresta[0]].append([aresta[1],aresta[2]]) 
    adjacencias[aresta[1]].append([aresta[0],aresta[2]])
    i += 1

q = int(input())
res = [0] * (q + 1)
i = 1
while i <= q:
    questao = input().split()
    u = questao[0]
    v = questao[1]
    for aresta in adjacencias[u]:
        visitados = [0] * (n + 1)
        cor = aresta[1]
        visitados[int(u)] = 1
        dfs(int(aresta[0]), cor, adjacencias, visitados)
        if visitados[int(v)] == 1:
            res[i] += 1
    i += 1

del(res[0])
for e in res:
    print(e)