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.IOException;
import java.io.InputStreamReader;
import java.util.StringTokenizer;

public class Graph {
  
  public static void main(String[] args) {
    int n = nextInt();
    int m = nextInt();
        
    int parent[][] = new int[n+1][m+1];
    for (int i = 0; i <= n; i++) {
      for (int j = 0; j <= m; j++) {
        parent[i][j]=i;
      }
    }
    
    for (int i = 0; i < m; i++) {
      //edges
      int from = nextInt();
      int to = nextInt();
      
      int color = nextInt();

      while (from != parent[from][color]) {
        from = parent[from][color];
      }
      while (to != parent[to][color]) {
        to = parent[to][color];
      }
      
      
      int min = Math.min(parent[from][color], parent[to][color]);
      parent[from][color] = min;
      parent[to][color] = min;
      
    }
    
    int q = nextInt();
    for (int i = 0; i < q; i++) {
      //queries
      int from = nextInt();
      int to = nextInt();
      int count = 0;
      for (int j=0; j <= m ;j++) {
        
        int parent1 = parent[from][j];
        while (parent1 != parent[parent1][j]) {
          parent1 = parent[parent1][j];
        }
        
        int parent2 = parent[to][j];
        while (parent2 != parent[parent2][j]) {
          parent2 = parent[parent2][j];
        }
        
        if (parent1 == parent2) {
          count++;
        }
        
      }
      System.out.println(count);
      
    }
    
  }
  
  
  
  
    static BufferedReader reader;
    static StringTokenizer tokenizer;

    static {
        reader = new BufferedReader(new InputStreamReader(System.in), 32768);
        tokenizer = null;
    }

    static String nextLine(){
        try {
            return reader.readLine();
        }
        catch (IOException e) {
            throw new RuntimeException(e);
        }
    }

    static String next() {
        while (tokenizer == null || !tokenizer.hasMoreTokens()) {
            try {
                tokenizer = new StringTokenizer(reader.readLine());
            } catch (IOException e) {
                throw new RuntimeException(e);
            }
        }
        return tokenizer.nextToken();
    }

    static int nextInt() {
        return Integer.parseInt(next());
    }


    static long nextLong() {
        return Long.parseLong(next());
    }
}
