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 java.util.Scanner;

/**
 * Created by naveen on 13-Dec-15.
 */
public class ColorGraph {
    boolean[][][] graph;
    int cc = 0;

    public static void main(String[] args) {
        ColorGraph obj = new ColorGraph();
        obj.init();
    }

    private void init() {
        Scanner scn = new Scanner(System.in);
        int n = scn.nextInt();
        int m = scn.nextInt();

        graph = new boolean[m][n][n];

        for (int i = 0; i < m; i++) {
            int f = scn.nextInt();
            int t = scn.nextInt();
            int c = scn.nextInt();

            if(c > cc)
                cc = c;

            graph[c-1][f-1][t-1] = graph[c-1][t-1][f-1] = true;
        }

        //populate c
        int q = scn.nextInt();
        for (int i = 0; i < q; i++) {
            int frm = scn.nextInt()-1;
            int to = scn.nextInt()-1;

            int counter = 0;
            for (int j = 0; j < cc; j++) {
                boolean[] v = new boolean[n];
                v[frm] = true;

                if(isConnect(graph[j], frm, to, v))
                    counter++;
            }

            System.out.println(counter);
        }

    }

    private boolean isConnect(boolean[][] grp, int frm, int to, boolean[] v) {
        if(frm==to)
            return true;
        else
        {
            boolean x = false;
            for (int i = 0; i < grp[0].length; i++) {
                if(grp[frm][i] && !v[i])
                {
                    v[i] = true;
                    x = isConnect(grp, i, to, v);

                    if(x)
                        break;
                }
            }

            return x;
        }
        //return false;
    }
}
