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 -*-
 
# Universidade Federal de Campina Grande
# Aluno: Diego Adolfo Silva de Araújo
# Matricula: 113210090
# Disciplina: Algoritmos Avançados

# Codeforces 
# Problem: 505B - B. Mr. Kitayuta's Colorful Graph
# Time limit per test: 1 second
# Memory limit per test: 256 megabytes
# Input: standard input
# Output: standard output

def answer(start, end):
    count = 0
    global graph
    
    for key in graph:
        if start not in graph[key] or end not in graph[key]:
            continue
        
        if list([path for path in dfs_paths(graph[key], start, end, [])]):
            count += 1
    
    return count

def dfs_paths(graph, start, end, path):
    if not path:
        path.append(start)
    
    if start == end:
        yield path
    
    for vertex in graph[start] - set(path):
        for key in dfs_paths(graph, vertex, end, path + [vertex]):
            yield key

        

graph = {}      
n, m = map(int, raw_input().split())

for value in xrange(m):
    vertex, edge, color = map(int, raw_input().split())
    
    if not graph.has_key(color):
        graph[color] = {}
    
    if not graph[color].has_key(edge):
        graph[color][edge] = set()
    
    if not graph[color].has_key(vertex):
        graph[color][vertex] = set()
       
    graph[color][edge].add(vertex) 
    graph[color][vertex].add(edge)

num_queries = int(raw_input())

for line in xrange(num_queries):
    u, v = map(int, raw_input().split())
    print answer(u, v)