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.File;
import java.io.FileNotFoundException;
import java.io.PrintWriter;
import java.util.ArrayList;
import java.util.LinkedList;
import java.util.List;
import java.util.Queue;
import java.util.Scanner;

public class Main {
    
    private static int[][][] M = new int[101][101][101];
    
    static Scanner sc = new Scanner(System.in);
    static PrintWriter pw = new PrintWriter(System.out);
    
    public static void main(String[] args) {
        
        /*try {
            sc = new Scanner(new File("autocomplete.txt"));
            pw = new PrintWriter(new File("output.txt"));
        } catch (FileNotFoundException e) {
            e.printStackTrace();
        }*/
        
        int n = sc.nextInt(), m = sc.nextInt();
        for(int i=0;i<m;i++) {
            int a = sc.nextInt(), b = sc.nextInt(), c = sc.nextInt();
            a--; b--; c--;
            
            M[c][a][b] = 1;
            M[c][b][a] = 1;
        }
        
        int q = sc.nextInt();
        for(int i=0;i<q;i++) {
            int u = sc.nextInt(), v = sc.nextInt(), res = 0;
            for(int j=0;j<m;j++) {
                res += check(n, u-1, v-1, j);
            }
            pw.println(res);
        }
        
        sc.close();
        pw.flush();
        pw.close();
    }
    
    private static int check(int n, int u, int v, int d) {
        boolean[] f = new boolean[n];
        
        for(boolean b : f) {
            b = false;
        }
        
        Queue<Integer> queue = new LinkedList<Integer>();
        queue.add(u);
        f[u] = true;
        
        while(!queue.isEmpty()) {
            int cur = queue.poll();
            for(int i=0;i<n;i++) {
                if(!f[i] && M[d][cur][i] == 1) {
                    f[i] = true;
                    queue.add(i);
                }
            }
        }
        
        if(f[v]) return 1;
        else return 0;
    }
    
    private static class Arc {
        public Arc(int a, int b, int c) {
            this.a = a;
            this.b = b;
            this.c = c;
        }
        
        public int a;
        public int b;
        public int c;
    }
}