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>.
import copy
info= list(map(int, input().split()))
n=info[0]
m=info[1]
mat=[[[] for i in range(n)] for j in range(n)]
for i in range(m):
    info= list(map(int, input().split()))
    a=info[0]
    b=info[1]
    c=info[2]
    mat[a-1][b-1].append(c)
    mat[b-1][a-1].append(c)
q=int(input())
for i in range(q):
    info= list(map(int, input().split()))
    u=info[0]-1
    v=info[1]-1
    l=[]
    for j in range(n):
        p=len(mat[u][j])
        for h in range(p):
            l.append(mat[u][j][h])
    l=list(set(l))
    p=len(l)
    c=0
    for j in range(p):
        g = copy.deepcopy(mat)
        co=l[j]
        stk=[]
        curr=u
        while(True):
            found=False
            for h in range(n):
                if(co in g[curr][h]):
                    stk.append(curr)
                    g[curr][h]=[]
                    curr=h
                    found=True
                    break
            if(curr==v):
                c+=1
                break
            if(not(found)):
                if(len(stk)==0):
                    break
                curr=stk[-1]
                stk.pop(-1)
    print(c)