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.math.*;
import java.io.*; 
import java.io.*; 
public class Graphs{

static int V;
static int ans=0;
	static ArrayList<ArrayList<pair>> edges=new ArrayList<ArrayList<pair>>(); 
	static int n,m,q;
static boolean vis[]=new boolean[101];
static boolean cvis[]=new boolean [109];
static void dfs(int cur,int end,int color){
	if(vis[cur])
		return;
	vis[cur]=true;
	if(cur==end){
		ans++;
		return;

	}
	for(int i=0;i<edges.get(cur).size();i++){
		if(edges.get(cur).get(i).j==color&&!vis[edges.get(cur).get(i).i]){
			dfs(edges.get(cur).get(i).i,end,color);
		}
	}
}


   /* static void addEdge(int v,int w) 
    { 
        edges[v].add(w);
        edges[w].add(v); 
    }*/ 
	




 

	static void memset(boolean vis[]){
		for(int i=0;i<vis.length;i++){
			vis[i]=false;
		}
	}
public static void main(String[] args) {


	for(int i=0;i<106;i++){
		edges.add(new ArrayList());
	}
//pair es[]=new pair[106];

	InputReader scan=new InputReader(System.in);
	PrintWriter out=new PrintWriter(System.out);
	n=scan.nextInt();m=scan.nextInt();
	for(int i=0;i<m;i++){
		int x=scan.nextInt();
		int y=scan.nextInt();
		int c=scan.nextInt();
		edges.get(x).add(new pair(y,c));
		edges.get(y).add(new pair(x,c));
	}
	q=scan.nextInt();
	
	while(q-->0){
		int a=scan.nextInt();
		int b =scan.nextInt();
		
for(int i=0;i<edges.get(a).size();i++){
	if(!cvis[edges.get(a).get(i).j]){
		cvis[edges.get(a).get(i).j]=true;
		dfs(a,b,edges.get(a).get(i).j);

		memset(vis);
//out.println(ans);
	}
	
}
memset(cvis);
out.println(ans);
ans=0;


	}
	
            out.close();
}
static class InputReader {
 
        public BufferedReader reader;
        public StringTokenizer tokenizer;
 
        public InputReader(InputStream stream) {
            reader = new BufferedReader(new InputStreamReader(stream), 32768);
            tokenizer = null;
        }
 
        public String next() {
            while (tokenizer == null || !tokenizer.hasMoreTokens()) {
                try {
                    tokenizer = new StringTokenizer(reader.readLine());
                } catch (IOException e) {
                    throw new RuntimeException(e);
                }
            }
            return tokenizer.nextToken();
        }
 
        public int nextInt() {
            return Integer.parseInt(next());
        }
 
        public Double nextDouble() {
            return Double.parseDouble(next());
        }
 
        public long nextLong() {
            return Long.parseLong(next());
        }
 
        public int[] nextIntArray(int arraySize) {
            int array[] = new int[arraySize];
 
            for (int i = 0; i < arraySize; i++) {
                array[i] = nextInt();
            }
 
            return array;
        }
 
    }
static class pair{
	int i;
	int j;
pair(int i,int j){
	this.i=i;
	this.j=j;
}

}

   
}

