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. 
# 505B.py
# Mr. Kitayuta's Colorful Graph

#First try
# n,m = map(int, raw_input().split())
# g = [[[] for _ in range(n+1)] for _ in range(m+1)]
# for i in xrange(m):
#     a,b,c = map(int, raw_input().split())
#     g[c][a].append(b)

# q = int(raw_input())

# for i in xrange(q):
#     u,v = map(int, raw_input().split())
#     out = 0
#     for j in xrange(1, len(g)):
#         u_found = v_found = False
#         for k in xrange(1, n+1):
#             if g[j][k]:
#                if k == u:
#                      u_found = True
#                elif k == v:
#                      v_found = True

#                for l in g[j][k]:
#                     if l == u:
#                         u_found = True
#                     elif l == v:
#                         v_found = True
#             if v_found == True and u_found == True:
#                 break
#         if v_found == True and u_found == True:
#             out += 1

#     print out
        
#Editorial
#DFS

#file = open("505Btest")
f = lambda: input()
#f = lambda: file.readline()
ml = lambda: list(map(int, f().split()))

n,m = ml()
g = [[ []for x in range(n+1)] for x in range(m+1)]

for i in range(m):
    a,b,c = ml()
    g[c][a].append(b)
    g[c][b].append(a)

q = int(f())

def dfs(c, start, end):
    global g, n
    discovered = [False] *(n+1)
    s = []
    s.append(start)
    while s:
        v = s.pop()
        if not discovered[v]:
            discovered[v] = True
            for i in g[c][v]:
                if i == end:
                    return True
                s.append(i)

    return False

for i in range(q):
    u,v = ml()
    count = 0
    for j in range(1, m+1):
        if g[j]:
            if dfs(j, u, v):
                count += 1
    print(count)
            
