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. 
//package codeforces;

import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.ArrayList;
import java.util.List;

/**
 * Created by brajesh.k on 09/09/15.
 */
public class Problem505B {
    private static List<List<Edge>> mAdjGraph;
    private static boolean[] mVisited;
    public static void main(String[] args) throws IOException {



        BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
        String[] line;
        line = br.readLine().split(" ");
        int n = Integer.parseInt(line[0]);
        int m = Integer.parseInt(line[1]);
        List<Integer> colors = new ArrayList<Integer>();
        mVisited = new boolean[n];
        // init empty graph
        mAdjGraph = new ArrayList< List<Edge>>();
        for (int i = 0; i < n; i++) {
            mAdjGraph.add(new ArrayList<Edge>());

        }

        for (int i = 0; i < m; i++) {

            line = br.readLine().split(" ");
            int a = Integer.parseInt(line[0]) - 1;
            int b = Integer.parseInt(line[1]) - 1;
            int c = Integer.parseInt(line[2]);
            mAdjGraph.get(a).add(new Edge(b, c));
            mAdjGraph.get(b).add(new Edge(a, c));
            if(!colors.contains(c)) {
                colors.add(c);
            }
        }

        int q = Integer.parseInt(br.readLine());
        for (int i = 0; i < q; i++) {


            line = br.readLine().split(" ");
            int a = Integer.parseInt(line[0]) - 1;
            int b = Integer.parseInt(line[1]) - 1;
            int cnt = 0;
            for (int c : colors) {
                for (int j = 0; j < n; j++) {
                    mVisited[j] = false;
                }
                if(dfs(a, b, c)) {
                    cnt++;
                }
            }
            System.out.println(cnt);
        }
    }

    private static boolean dfs(int start, int end, int color) {
        mVisited[start] = true;
        if(start == end) {
            return true;
        }


        List<Edge> adjNodes = mAdjGraph.get(start);
        for (Edge e : adjNodes) {
            int edgeColor = e.c;
            if(edgeColor == color && !mVisited[e.a]) {
                if (dfs(e.a, end, color)){
                    return true;
                }
            }
        }
        return false;
    }


    public static class Edge {
        int a;
        int c; // color of edge

        public Edge(int a, int c) {
            this.a = a;
            this.c = c;
        }
    }
}
