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.util.*;
import java.io.*;
/**
 *
 * @author alanl
 */
public class Main{
    static BufferedReader input = new BufferedReader(new InputStreamReader(System.in));
    static StringTokenizer st;
    static PrintWriter pr = new PrintWriter(new BufferedWriter(new OutputStreamWriter(System.out)));
    static int ans = 0, n, m;
    static Set<Integer>s;
    static ArrayList<edge>adj[];
    public static void main(String[] args) throws IOException{
        n = readInt();
        m = readInt();
        adj = new ArrayList[n+1];
        for(int i = 1; i<=n; i++)adj[i] = new ArrayList();
        for(int i = 0; i<m; i++){
            int a = readInt(), b = readInt(), w = readInt();
            adj[a].add(new edge(b, w));
            adj[b].add(new edge(a, w));
        }
        int q = readInt();
        for(int i = 0; i<q; i++){
            int a = readInt(), b = readInt();
            ans = 0;
            s = new HashSet();
            dfs(a, b, -1, new boolean[n+1]);
            println(s.size());
        }
    }
    static void dfs(int u, int end, int cur, boolean[]vis){
        if(u==end){
            s.add(cur);
            return;
        }
        vis[u] = true;
        if(cur==-1){
            for(edge e:adj[u]){
                if(!vis[e.v]){
                    dfs(e.v, end, e.w, vis);
                }
            }
        }
        else{
            for(edge e:adj[u]){
                if(!vis[e.v] && e.w==cur){
                    dfs(e.v, end, cur, vis);
                }
            }
        }
        vis[u] = false;
    }
    static class edge{
        int v, w;
        edge(int v0, int w0){
            v = v0;
            w = w0;
        }
    }
    static String next () throws IOException {
        while (st == null || !st.hasMoreTokens())
                st = new StringTokenizer(input.readLine().trim());
        return st.nextToken();
    }
    static long readLong () throws IOException {
        return Long.parseLong(next());
    }
    static int readInt () throws IOException {
        return Integer.parseInt(next());
    }
    static double readDouble () throws IOException {
        return Double.parseDouble(next());
    }
    static char readChar () throws IOException {
        return next().charAt(0);
    }
    static String readLine () throws IOException {
        return input.readLine().trim();
    }
    static void print(Object b) {
        System.out.print(b);
    }
    static void println(Object b) {
        System.out.println(b);
    }
    static void println() {
        System.out.println();
    }
}
