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. 
import sys
import math
from collections import defaultdict
import itertools

MAXNUM = math.inf
MINNUM = -1 * math.inf


def getInt():
    return int(sys.stdin.readline().rstrip())


def getInts():
    return map(int, sys.stdin.readline().rstrip().split(" "))


def getString():
    return sys.stdin.readline().rstrip()


def printOutput(ans):
    sys.stdout.write()
    pass


def dfs(a, b, edgeList):

    total = 0
    cLook = set()

    for nxt, col in edgeList[a]:
        if col not in cLook:
            explored = dict()
            explored[a] = True
            explored[nxt] = True
            if dfs_helper(nxt, b, edgeList, col, explored) == 1:
                cLook.add(col)
                total += 1

    return total


def dfs_helper(cur, goal, edgeList, color, explored):

    if cur == goal:
        return 1

    for nxt, col in edgeList[cur]:
        if col == color and nxt not in explored:
            explored[nxt] = True
            if dfs_helper(nxt, goal, edgeList, color, explored) == 1:
                return 1
            del explored[nxt]

    return 0


def solve(n, m, edgeList, queries):
    for a, b in queries:
        print(dfs(a, b, edgeList))


def readinput():
    n, m = getInts()
    edgeList = defaultdict(list)
    for _ in range(m):
        a, b, c = getInts()
        edgeList[a].append((b, c))
        edgeList[b].append((a, c))

    queries = []
    q = getInt()
    for _ in range(q):
        queries.append(tuple(getInts()))
    (solve(n, m, edgeList, queries))


readinput()
