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.HashSet;
import java.util.Set;
import java.util.StringTokenizer;

public class Graph {
  
  public static void main(String[] args) {
    int n = nextInt();
    int m = nextInt();
    
    Set<Integer> [][]state = new Set[n+1][m+1];
    
    for (int i = 0; i < m; i++) {
      //edges
      int from = nextInt();
      int to = nextInt();
      if (from == to || from >n || to > n) {
        continue;
      }
      int color = nextInt();
      
      
      if (state[from][color] == null) {
        state[from][color] = new HashSet<Integer>();
      }
      
      if (state[to][color] == null) {
        state[to][color] = new HashSet<Integer>();
      }
      
      for (Integer mid: state[to][color]) {
        state[from][color].add(mid);
//        if (mid != to) {
          state[mid][color].add(from);
//        }
      }
      
      for (Integer mid: state[from][color]) {
        state[to][color].add(mid);
//        if (mid != from)  {
          state[mid][color].add(to);
//        }
      }
      
      state[from][color].add(to);
      state[to][color].add(from);
      
    }
    
    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++) {
        if ((from <=n && state[from][j] != null && state[from][j].contains(to))
            ||  (to <=n && state[to][j] != null && state[to][j].contains(from))) {
          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());
    }
}
