Mr. Kitayuta has just bought an undirected graph consisting of 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 ≤ 100, 1 ≤ m ≤ 100), 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 ≤ 100), 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. 
2 1
1 2 1
1
1 2
 2 3
1 2 3
1 2 2
1 2 1
1
1 2
 2 5
1 2 1
1 2 2
1 2 3
1 2 4
1 2 5
1
1 2

1
 3
 5

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


public class Code505B {

    private static List<Pair>[] graph;
    private static boolean[] visited;
    private static int V;
    
    
    private static void addEgde(int from, int to, int color){
        Pair p1 = new Pair(to, color);
        Pair p2 = new Pair(from, color);
        graph[from].add(p1);
        graph[to].add(p2);
    }
    
    private static boolean dfs(int fromV, int toV, int color){
        visited[fromV] = true;
        if(fromV == toV){
            return true;
        }
        for (int i = 0; i < graph[fromV].size(); i++) {
            Pair p = graph[fromV].get(i);
            if(p.getColor() == color && !visited[p.getToV()]){
                if(dfs(p.getToV(),toV,color)){
                    return true;
                }
            }
        }
        return false;
    }
    
    public static void main(String[] args) throws IOException {
        BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
        String[] input = br.readLine().split(" ");
        V = Integer.parseInt(input[0]);
        int E = Integer.parseInt(input[1]);
        int fromV, toV, color, queries, numOfColors;
        graph = new ArrayList[V+1];
        visited = new boolean[V+1];
        for (int i = 1; i <= V; i++) {
            graph[i] = new ArrayList<Pair>();
        }
        for (int i = 0; i < E; i++) {
            input = br.readLine().split(" ");
            fromV = Integer.parseInt(input[0]);
            toV = Integer.parseInt(input[1]);
            color = Integer.parseInt(input[2]);
            addEgde(fromV, toV, color);
        }
        queries = Integer.parseInt(br.readLine());
        for (int i = 0; i < queries; i++) {
            input = br.readLine().split(" ");
            fromV = Integer.parseInt(input[0]);
            toV = Integer.parseInt(input[1]);
            numOfColors = 0;
            for (int c = 1; c <= V; c++) {
                for (int j = 1; j <= V; j++) { //clear visited[] before the dfs() call 
                    visited[j] = false;
                }
                if(dfs(fromV, toV, c)){
                    numOfColors++;
                }
            }
            System.out.println(numOfColors);
        }
    }

}

class Pair{
    
    private int toV;
    private int color;
    
    public Pair(int toV, int color) {
        this.toV = toV;
        this.color = color;
    }
    
    public int getColor() {
        return color;
    }
    
    public int getToV() {
        return toV;
    }
}
