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


public class B {
static LinkedList<Integer> [][]g;
static boolean v[];
static boolean col[];
static int n;
    public static void main(String[] args) throws Exception{
        n=in();
     int m=in();
     v=new boolean [n+1];
     g=new LinkedList [n+1][n+1];
     col=new boolean[m+2];
     for (int i=0;i<m;i++){
         int t1=in();
         int t2=in();
         int c=in();
        if ( g[t1][t2]==null)g[t1][t2]=new LinkedList<>();
         if (g[t2][t1]==null)g[t2][t1]=new LinkedList<>();
         g[t1][t2].add(c);
         g[t2][t1].add(c);
     }
StringBuilder b=new StringBuilder();
int q=in();
for (int i=0;i<q;i++){
    b.append(dfs(in(),in(),0)+"\n");
     v=new boolean [n+1];
     col=new boolean[m+2];
}
System.out.println(b);
    }

    private static int  dfs(int i, int j, int c) {
    //  System.out.println(i+" "+j);
        if (i==j){
            if (col[c])return 0;
            else{
                col[c]=true;
                return 1;
            }
            
        }
        if (v[i]){
            
            return 0;
        }
        int r=0;
        v[i]=true;
        for (int k=0;k<g[i].length;k++){
            if (g[i][k]!=null)
            for (int t:g[i][k])
            if (t!=0 && (t==c || c==0)){
                r+=dfs(k,j,t);
            }
        }
        v[i]=false;
        return r;
    }

    static BufferedReader buf=new BufferedReader(new InputStreamReader(System.in));
    static StringTokenizer st;
    static int in() throws IOException{
        if (st==null || !st.hasMoreTokens()){
            st=new StringTokenizer(buf.readLine());
        }
        return Integer.parseInt(st.nextToken());
    }
    static long ll() throws IOException{
        if (st==null || !st.hasMoreTokens()){
            st=new StringTokenizer(buf.readLine());
        }
        return Long.parseLong(st.nextToken());
    }
    static String str() throws IOException{
        if (st==null || !st.hasMoreTokens()){
            st=new StringTokenizer(buf.readLine());
        }
        return (st.nextToken());
    }
        static double dub() throws IOException{
            if (st==null || !st.hasMoreTokens()){
                st=new StringTokenizer(buf.readLine());
            }
            return Double.parseDouble(st.nextToken());
    }
}
