Mr. Kitayuta has just bought an undirected graph consisting of 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 ≤ 100, 1 ≤ m ≤ 100), 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 ≤ 100), 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. 
2 1
1 2 1
1
1 2
 2 3
1 2 3
1 2 2
1 2 1
1
1 2
 2 5
1 2 1
1 2 2
1 2 3
1 2 4
1 2 5
1
1 2

1
 3
 5

import java.io.*;
import java.util.*;

public class GraphColoredPath {

	public static int ways(Node[] n,int start,int dest)
	{
		int result = 0;
		for(ArrayList<Integer> a : n[start].l)
		{
			
			if(n[a.get(0)].value==dest)
				result++;
			else
			{
				if(n[a.get(0)].color=="white")
				{
				n[a.get(0)].color = "green";
				result += dfsways(n,a.get(0),dest,a.get(1));
				n[a.get(0)].color = "white";
			    }
			}
		}
		return result;
	}
	
	public static int dfsways(Node[] n,int start,int dest,int weight)
	{
		int result = 0;
		for(ArrayList<Integer> a : n[start].l)
		{
			if( a.get(1)==weight)
			{
			if(n[a.get(0)].value==dest)
				result++;
			else
			{
				if(n[a.get(0)].color=="white")
				{
				n[a.get(0)].color = "green";
				result += dfsways(n,a.get(0),dest,a.get(1));
				n[a.get(0)].color = "white";
			    }
			}
			}
		}
		return result;
	}

	public static void main(String[] args) throws NumberFormatException, IOException {
	
	  Scanner in = new Scanner(System.in);
		int vertex = in.nextInt();
        int edges = in.nextInt();
        Node[] n = new Node[vertex];
        for(int i = 0;i<vertex;i++)
        {
        	n[i] = new Node(i);
        }
        for(int i = 0;i<edges;i++)
        {
        	ArrayList<Integer> a = new ArrayList<Integer>();
        	int start = in.nextInt();
        	a.add(in.nextInt()-1);
        	a.add(in.nextInt()-1);
        	n[start-1].l.add(a);
        	ArrayList<Integer> b = new ArrayList<Integer>();
        	int star = a.get(0);
        	b.add(start-1);
        	b.add(a.get(1));
        	n[star].l.add(b);        	
        }
        int Query = in.nextInt();
        Q[] q = new Q[Query];
       for(int i = 0;i<Query;i++)
        {
    	   q[i] = new Q();
        	q[i].start = in.nextInt();
        	q[i].dest = in.nextInt();
        	
        }
       for(int i = 0;i<Query;i++)
       {
    	   n[q[i].start-1].color = "green";
       	System.out.println(ways(n,q[i].start-1,q[i].dest-1));
       	n[q[i].start-1].color = "white";
       }
      
	}

}
class Node
{
	int value;
	String color ;
	ArrayList<ArrayList<Integer>> l;
	Node(int value)
	{
		this.value = value;
		this.color = "white";
		this.l = new ArrayList<ArrayList<Integer>>();
	}
}
class Q
{
	int start;
	int dest;
}