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. 
/*
 * To change this license header, choose License Headers in Project Properties.
 * To change this template file, choose Tools | Templates
 * and open the template in the editor.
 */
//package codeforces;


import java.io.File;
import java.util.ArrayList;
import java.util.Scanner;

/**
 *
 * @author hamza
 */
public class KitautaHamza {

    /**
     * @param args the command line arguments
     */
    static boolean vis[];
    static ArrayList<Edges> e;

    static class Edges {

        int from, to, color;

        Edges(int u, int v, int c) {
            from = u;
            to = v;
            color = c;
        }
    }

    static void dfs(int u, int c) {
        vis[u] = true;
        for (int i = 0; i < e.size(); i++) {
            Edges cur = e.get(i);
            if (cur.from == u && !vis[cur.to] && cur.color == c) {
                vis[cur.to] = true;
                dfs(cur.to, c);
            }
        }
    }

    public static void main(String[] args) {
        try {
            Scanner sc = new Scanner(System.in);
            int n = sc.nextInt();
            int m = sc.nextInt();
            int q = 0;
            int u = 0;
            int v = 0;
            int c = 0;
            e = new ArrayList<Edges>();
            for (int i = 0; i < m; i++) {
                u = sc.nextInt() - 1;
                v = sc.nextInt() - 1;
                c = sc.nextInt();
                e.add(new Edges(u, v, c));
                e.add(new Edges(v, u, c));
            }

            int p = sc.nextInt();
            for (int i = 0; i < p; i++) {
                u = sc.nextInt() - 1;
                v = sc.nextInt() - 1;
                int count = 0;
                for (int j = 1; j <= m; j++) {
                vis = new boolean[n];
                    dfs(u, j);
                    if (vis[v]) {
                        count++;
                    }
                }
                System.out.println(count);
            }

        } catch (Exception e) {
        }
    }

}
