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.InputStream;
import java.io.InputStreamReader;
import java.util.HashMap;
import java.util.StringTokenizer;

public class C286DIV1_D{
	public static void main(String args[]) throws IOException{
		Reader.init(System.in);
		int n=Reader.nextInt();
		int m=Reader.nextInt();
		UnionFind uf=new UnionFind(n,m);
		int c,n1,n2;
		for(int i=0;i<m;i++){
			n1=Reader.nextInt();
			n2=Reader.nextInt();
			c=Reader.nextInt();
			uf.Union(n1-1, n2-1, c-1);;
		}
		int q=Reader.nextInt();
		for(int j=0;j<q;j++){
			n1=Reader.nextInt();
			n2=Reader.nextInt();
			int count=0;
			for(int i=0;i<m;i++){
				if(uf.find(n1-1, n2-1, i))
					count++;
			}
			System.out.println(count);
		}
		
		
	}
}


/** Class for buffered reading int and double values */
class Reader {
    static BufferedReader reader;
    static StringTokenizer tokenizer;

    /** call this method to initialize reader for InputStream */
    static void init(InputStream input) {
        reader = new BufferedReader(
                     new InputStreamReader(input) );
        tokenizer = new StringTokenizer("");
    }

    /** get next word */
    static String next() throws IOException {
        while ( ! tokenizer.hasMoreTokens() ) {
            //TODO add check for eof if necessary
            tokenizer = new StringTokenizer(
                   reader.readLine() );
        }
        return tokenizer.nextToken();
    }

    static int nextInt() throws IOException {
        return Integer.parseInt( next() );
    }
    static long nextLong() throws IOException {
        return Long.parseLong( next() );
    }
	

}


class UnionFind{
	public int[][] index;
	public UnionFind(int n, int m){
		index=new int[m][n];
		for(int i=0;i<m;i++){
			for(int j=0;j<n;j++){
				index[i][j]=j;
			}
		}
	}
	public boolean find(int i, int j, int ind){
		if(index[ind][i]==index[ind][j])
			return true;
		else return false;
	}
	public void Union(int i, int j, int ind){
		for(int e=0;e<index[ind].length;e++){
			if( e!=j&& index[ind][e]==index[ind][j]){
				index[ind][e]=index[ind][i];
			}
		}
		index[ind][j]=index[ind][i];
	}
	
	
}