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.io.BufferedReader;
import java.io.InputStreamReader;
import java.util.HashSet;
import java.util.LinkedList;

public class Main2 {

    public static class edge {
        int from;
        int to;
        int c;

        public edge(int from, int to, int c) {
            this.from = from;
            this.to = to;
            this.c = c;
        }

    }

    public static void main(String[] args) throws Exception {
        // BufferedReader br = new BufferedReader(new FileReader("input.txt"));
        // PrintWriter out = new PrintWriter(new BufferedWriter(new
        // FileWriter("output.txt")));
        BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
        String[] in = br.readLine().split(" ");

        int n = Integer.parseInt(in[0]);
        int m = Integer.parseInt(in[1]);

        HashSet<Integer> colour = new HashSet<Integer>();

        LinkedList<edge> e = new LinkedList();
        for (int i = 0; i < m; i++) {
            in = br.readLine().split(" ");
            colour.add(Integer.parseInt(in[2]));
            edge temp = new edge(Integer.parseInt(in[0])-1,
                    Integer.parseInt(in[1])-1, Integer.parseInt(in[2]));
            e.add(temp);
        }
        in = br.readLine().split(" ");
        int q = Integer.parseInt(in[0]);
        int[][]query = new int[q][2];
        for(int i = 0;i<q;i++){
            in = br.readLine().split(" ");
            query[i][0] = Integer.parseInt(in[0])-1;
            query[i][1] = Integer.parseInt(in[1])-1;
        }
        for (int i = 0; i < q; i++) {
            int ans = 0;

            for (int c : colour) {
                LinkedList<Integer>[]adj = new LinkedList[n];
                for(int j = 0;j<n;j++)
                {
                    adj[j] = new LinkedList();
                }
                for(edge k:e){
                    if(k.c==c){
                        adj[k.from].add(k.to);
                        adj[k.to].add(k.from);
                    }
                }
                boolean[]visited = new boolean[n];
                if(dfs(query[i][0],query[i][1],visited,adj)){
                    ans++;
                }
            }
            System.out.println(ans);

        }

    }

    private static boolean dfs(int i, int j, boolean[] visited,
            LinkedList<Integer>[] adj) {
        if(i==j)
            return true;
        visited[i] = true;
        boolean ans = false;
        for(int k = 0;k<adj[i].size();k++){
            if(!visited[adj[i].get(k)]){
                 ans = ans | dfs(adj[i].get(k),j,visited,adj);
            }
        }
        return ans;
    }

}
