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. 
# -*- coding: utf-8 -*-

import sys
from collections import defaultdict
from copy import deepcopy


def is_reachable(u, v, node_dic):
    # node_dicに基づき，uからvに道があるかをチェック
    now = u
    cons = set([])
    nex = [u]
    while 1:
        nax = []
        for n in nex:
            cons.add(n)
            if v in node_dic[n]:
                return True
            else:
                for node in node_dic[n]:
                    if not node in cons:
                        nax.append(node)
        nex = nax
        if not nex:
            break
    return False

def main():
    edges = []
    color_node_dic = defaultdict(lambda: defaultdict(list))
    n, m = map(int, raw_input().split(' '))
    colors = set([])
    nodes = set([])
    for _ in xrange(m):
        a, b, c = map(int, raw_input().split(' '))
        edges.append((a, b, c))
        colors.add(c)
    for edge in edges:
        color_node_dic[edge[2]][edge[0]].append(edge[1])
        color_node_dic[edge[2]][edge[1]].append(edge[0])
        nodes.add(edge[0])
        nodes.add(edge[1])

    q = input()
    for _ in xrange(q):
        u, v = map(int, raw_input().split(' '))
        ans = 0
        for color, node_dic in color_node_dic.iteritems():
            if is_reachable(u, v, node_dic):
                ans += 1
            else:
                pass
        print ans
            # 到達可能か？
            # nex = []
            # for node in node_dic[u]:
            #     cons = set([u])
            #     nex.append((node, cons))
            #     while nex:
            #         if nn[0] == v:
            #             
            #         for nn in nex:
            #             print node_dic[nn[0]]
            #         break

if __name__ == '__main__':
    main()
