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.*;
import java.io.*;


public class Colorful_Graph {

    static BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
    static StringTokenizer st;

    static int count = 0;
    static ArrayList<ArrayList<Edge>> adj = new ArrayList<ArrayList<Edge>>();
    static boolean[] v;
    public static void main(String[] args) throws IOException {
        int n = readInt();
        int m = readInt();
        for(int x = 0; x < n; x++)
            adj.add(new ArrayList<Edge>());
        for(int x = 0; x < m; x++){
            int a = readInt()-1;
            int b = readInt()-1;
            int c = readInt();
            adj.get(a).add(new Edge(b, c));
            adj.get(b).add(new Edge(a, c));
        }
        int q = readInt();
        for(int x = 0; x < q; x++){
            int a = readInt()-1;
            int b = readInt()-1;
            count = 0;
            for(int y = 1; y <= 100; y++){
                v = new boolean[n];
                int prevCount = count;
                dfs(a, b, y);
                if(count > prevCount)
                    count = prevCount+1;
            }
            System.out.println(count);
        }
    }
    private static void dfs(int a, int b, int y) {
        if(a == b){
            count++;
            return;
        }
        v[a] = true;
        for(Edge e : adj.get(a)){
            if(!v[e.dest] && e.color == y){
                dfs(e.dest, b, y);
            }
        }
    }
    static class Edge{
        int dest, color;
        Edge(int dest, int color){
            this.dest = dest;
            this.color = color;
        }
    }
    static String next() throws IOException {
        while (st == null || !st.hasMoreTokens())
            st = new StringTokenizer(br.readLine().trim());
        return st.nextToken();
    }

    static long readLong() throws IOException {
        return Long.parseLong(next());
    }

    static int readInt() throws IOException {
        return Integer.parseInt(next());
    }

    static double readDouble() throws IOException {
        return Double.parseDouble(next());
    }

    static String readLine() throws IOException {
        return br.readLine().trim();
    }
}
