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

public class KitayutasColorfulGraph {

    /**
     * @param args
     * @throws IOException
     */
    
    static class Pair {
        int x, y;
        public Pair(int xx, int yy) {
            x = xx;
            y = yy;
        }
    }
    
    static ArrayList<Pair>[] g;
    
    static boolean vis[];
    
    public static int dfs(int u, int v, int c) {
        if (vis[u])
            return 0;
        vis[u] = true;
        if (u == v)
            return 1;
        int res = 0;
        for (int i = 0; i < g[u].size(); i++) {
            if (g[u].get(i).y == c)
                res += dfs(g[u].get(i).x, v, c);
        }
        return res;
    }
    public static void main(String[] args) throws IOException {
        BufferedReader bf = new BufferedReader(new InputStreamReader(System.in));

        StringTokenizer st = new StringTokenizer(bf.readLine());

        int n = Integer.parseInt(st.nextToken());
        int m = Integer.parseInt(st.nextToken());
        
        g = new ArrayList[n];
        
        for (int i = 0; i < n; i++)
            g[i] = new ArrayList<Pair>();

        for (int i = 0; i < m; i++) {
            int a, b, c;
            st = new StringTokenizer(bf.readLine());
            a = Integer.parseInt(st.nextToken()) - 1;
            b = Integer.parseInt(st.nextToken()) - 1;
            c = Integer.parseInt(st.nextToken()) - 1;
            g[a].add(new Pair(b, c));
            g[b].add(new Pair(a, c));
        }
        
        
        int q = Integer.parseInt(bf.readLine());
        
        while (q-- > 0) {
            st = new StringTokenizer(bf.readLine());
            int a = Integer.parseInt(st.nextToken()) - 1;
            int b = Integer.parseInt(st.nextToken()) - 1;
            int res = 0;
            for (int i = 0; i <= m; i++) {
                vis = new boolean[n];
                res += dfs(a, b, i);
            }
            System.out.println(res);
        }
        
        

    }

}
