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. 
class Graph(object):
    def __init__(self, num_nodes):
        self.num_nodes = num_nodes
        self.adj_list = {}

    def __add_directional_edge(self, a, b, c):
        if a in self.adj_list:
            if b in self.adj_list[a]:
                if c not in self.adj_list[a][b]:
                    self.adj_list[a][b].append(c)
            else:
                self.adj_list[a][b] = []
                self.adj_list[a][b].append(c)
        else:
            self.adj_list[a] = {}
            self.adj_list[a][b] = []
            self.adj_list[a][b].append(c)

    def add_edge(self, a, b, c):
        self.__add_directional_edge(a, b, c)
        self.__add_directional_edge(b, a, c)

    def print_graph(self):
        print(self.adj_list)


def tc():
    g = readGraph()
    #  g.print_graph()
    for k in range(1, g.num_nodes + 1):
        for i in range(1, g.num_nodes + 1):
            for j in range(1, g.num_nodes + 1):
                l1 = g.adj_list.get(i, {}).get(k, [])
                l2 = g.adj_list.get(k, {}).get(j, [])
                for color in l1:
                    if color in l2:
                        g.add_edge(i,j,color)
    #  g.print_graph()
    return g


def readGraph():
    n, m = map(int, input().split())
    g = Graph(n)
    for _ in range(m):
        a, b, c = map(int, input().split())
        g.add_edge(a,b,c)
    return g


def read_query():
    q = int(input())
    q_list = []
    for _ in range(q):
        u,v = map(int, input().split())
        q_list.append((u,v))
    return q_list


def solve_query(g, q_list):
    for u,v in q_list:
        if u in g.adj_list:
            if v in g.adj_list[u]:
                print(len(g.adj_list[u][v]))
            else:
                print("0")
        else:
            print("0")


def main():
    g = tc()
    q_list = read_query()
    solve_query(g, q_list)


if __name__ == "__main__":
    main()