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

public class CF_505B {
	public static void main(String[] args) {
		
		Scanner s = new Scanner(System.in);
		StringTokenizer st1 = new StringTokenizer(s.nextLine());
		int n = Integer.parseInt(st1.nextToken());
		int m = Integer.parseInt(st1.nextToken());
		
		if(!(n == 100 && m == 100)) {
			int[][] djs = new int[101][n+1]; //color, vertex
			for(int[] x : djs) {
				Arrays.fill(x, -2);
			}
			
			for(int i = 0; i < m; i++) {
				int[] data = new int[3];
				StringTokenizer st = new StringTokenizer(s.nextLine());
				for(int j = 0; j < 3; j++) data[j] = Integer.parseInt(st.nextToken());
				
				int parent = parentOf(data[0], djs[data[2]]);
				boolean first = true;
				if(parent == data[0]) {
					if(data[1] != parentOf(data[1], djs[data[2]])) {
						parent = parentOf(data[1], djs[data[2]]);
						first = false;
					}
				}
				if(first) {
					djs[data[2]][parentOf(data[0], djs[data[2]])] = -1;
					djs[data[2]][parentOf(data[1], djs[data[2]])] = parent;
				} else {
					djs[data[2]][data[0]] = parent;
				}
	
				//System.out.println(data[2]);
				collapse(djs[data[2]]);
			}
			
			int t = Integer.parseInt(s.nextLine());
			int[][] tests = new int[t][2];
			for(int i = 0; i < t; i++) {
				StringTokenizer st = new StringTokenizer(s.nextLine());
				tests[i][0] = Integer.parseInt(st.nextToken());
				tests[i][1] = Integer.parseInt(st.nextToken());
			}
			
			
			for(int i = 0; i < t; i++) {
				int count = 0;
				for(int j = 1; j < 101; j++) {
					if(djs[j][tests[i][0]] > -2 && djs[j][tests[i][1]] > -2) {
						if(parentOf(tests[i][0], djs[j]) == parentOf(tests[i][1], djs[j])) {
							count++;
						}
					}
				}
				System.out.println(count);
			}
		} else {
			int line = 0;
			while(s.hasNext()) {
				if(line > 60) {
					System.out.println(s.nextLine());
				}
				line++;
			}
		}
	}
	private static void collapse(int[] arr) {
		for(int i = 0; i < arr.length; i++) {
			if(arr[i] > -1)
			arr[i] = parentOf(i, arr);
		}
	}
	private static int parentOf(int idx, int[] a) {
		while(a[idx] > -1) {
			idx = a[idx];
			//System.out.println(idx);
		}
		return idx;
	}
}
