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
input = stdin.readline
 
def main():
    n, m = map(int,input().split())
    sets = [list(range(n+1)) for i in range(m)]
    sizes = [[1]*(n+1) for i in range(m)]
    def get(a,ind):
        if sets[ind][a] != a:
            sets[ind][a] = get(sets[ind][a],ind)
        return sets[ind][a]
    def union(a, b,ind):
        a = get(a,ind)
        b = get(b,ind)
        if a == b:return
        if sizes[ind][a] > sizes[ind][b]:
            a,b = b,a
        sets[ind][a] = b
        sizes[ind][b] += sizes[ind][a]
    for i in range(m):
        a, b, c = map(int,input().split())
        a -= 1
        b -= 1
        c -= 1
        union(a,b,c)
    q = int(input())
    for i in range(q):
        ans = 0
        u,v = map(int,input().split())
        u-=1
        v-=1
        for j in range(m):
            ans += int(get(u,j) == get(v,j))
        print(ans)
main()
