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 *c*<sub class="lower-index">*i*</sub>, connecting vertex *a*<sub class="lower-index">*i*</sub> and *b*<sub class="lower-index">*i*</sub>.

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

In the *i*-th query, he gives you two integers — *u*<sub class="lower-index">*i*</sub> and *v*<sub class="lower-index">*i*</sub>.

Find the number of the colors that satisfy the following condition: the edges of that color connect vertex *u*<sub class="lower-index">*i*</sub> and vertex *v*<sub class="lower-index">*i*</sub> directly or indirectly.
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 — *a*<sub class="lower-index">*i*</sub>, *b*<sub class="lower-index">*i*</sub> (1 ≤ *a*<sub class="lower-index">*i*</sub> &lt; *b*<sub class="lower-index">*i*</sub> ≤ *n*) and *c*<sub class="lower-index">*i*</sub> (1 ≤ *c*<sub class="lower-index">*i*</sub> ≤ *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*<sub class="lower-index">*i*</sub>, *b*<sub class="lower-index">*i*</sub>, *c*<sub class="lower-index">*i*</sub>) ≠ (*a*<sub class="lower-index">*j*</sub>, *b*<sub class="lower-index">*j*</sub>, *c*<sub class="lower-index">*j*</sub>).

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 — *u*<sub class="lower-index">*i*</sub> and *v*<sub class="lower-index">*i*</sub> (1 ≤ *u*<sub class="lower-index">*i*</sub>, *v*<sub class="lower-index">*i*</sub> ≤ *n*). It is guaranteed that *u*<sub class="lower-index">*i*</sub> ≠ *v*<sub class="lower-index">*i*</sub>.
from sys import stdin, stdout

def find(node, color):
    x = []
    while colors[color][node] > 0:
        x.append(node)
        node = colors[color][node]
    for i in x:
        colors[color][i] = node
    return node

def union(node1, node2, color):
    if node1 != node2:
        if colors[color][node1] > colors[color][node2]:
            node1, node2 = node2, node1
        colors[color][node1] += colors[color][node2]
        colors[color][node2] = node1

n, m = map(int, stdin.readline().strip().split())
colors = [[-1 for i in range(n+1)] for j in range(m+1)]
for __ in range(m):
    a, b, c = map(int, stdin.readline().strip().split())
    union(find(b, c), find(a, c), c)
q = int(stdin.readline().strip())
outputs = []
for __ in range(q):
    count = 0
    a, b = map(int, stdin.readline().strip().split())
    for i in range(1, m+1):
        if find(a, i) == find(b, i):
            count += 1
    outputs.append(count)
for output in outputs:
    stdout.write(f'{output}\n')

