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 *c*<sub class="lower-index">*i*</sub>, connecting vertex *a*<sub class="lower-index">*i*</sub> and *b*<sub class="lower-index">*i*</sub>.

Mr. Kitayuta wants you to process the following *q* queries.

In the *i*-th query, he gives you two integers — *u*<sub class="lower-index">*i*</sub> and *v*<sub class="lower-index">*i*</sub>.

Find the number of the colors that satisfy the following condition: the edges of that color connect vertex *u*<sub class="lower-index">*i*</sub> and vertex *v*<sub class="lower-index">*i*</sub> directly or indirectly.
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 — *a*<sub class="lower-index">*i*</sub>, *b*<sub class="lower-index">*i*</sub> (1 ≤ *a*<sub class="lower-index">*i*</sub> &lt; *b*<sub class="lower-index">*i*</sub> ≤ *n*) and *c*<sub class="lower-index">*i*</sub> (1 ≤ *c*<sub class="lower-index">*i*</sub> ≤ *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*, (*a*<sub class="lower-index">*i*</sub>, *b*<sub class="lower-index">*i*</sub>, *c*<sub class="lower-index">*i*</sub>) ≠ (*a*<sub class="lower-index">*j*</sub>, *b*<sub class="lower-index">*j*</sub>, *c*<sub class="lower-index">*j*</sub>).

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 — *u*<sub class="lower-index">*i*</sub> and *v*<sub class="lower-index">*i*</sub> (1 ≤ *u*<sub class="lower-index">*i*</sub>, *v*<sub class="lower-index">*i*</sub> ≤ *n*). It is guaranteed that *u*<sub class="lower-index">*i*</sub> ≠ *v*<sub class="lower-index">*i*</sub>.
#define _CRT_SECURE_NO_WARNINGS
#include<stdio.h>
#include<iostream>
#include<math.h>
#include<map>
#include<set>
#include<algorithm>
#include<string>
#include<string.h>
#include<vector>
#include<queue>
#include<stack>
#define ll long long
using namespace std;
int s[105][105] = { 0 };
int n, m, u, v, c;

void inti()
{
	for (int i = 1; i <= n; i++)
	{
		for (int j = 1; j <= n; j++)
		{
			s[i][j] = i;
		}
	}
}

int find_set(int x,int c)
{
	return s[x][c] == x ? x : p[x][c]=find_set(s[x][c], c);
}

int main()
{
	inti();
	scanf("%d%d", &n, &m);
	for (int i = 1; i <= m; i++)
	{
		scanf("%d%d%d", &u, &v, &c);
		int x = find_set(u, v);
		int y = find_set(v, v);
		if (x != y)
			s[x][c] = y;
	}
	int q;
	scanf("%d", &q);
	while (q--)
	{
		int ans = 0;
		int a, b;
		scanf("%d%d", &a, &b);
		for (int i = 1; i <= m; i++)
		{
			if (find_set(a, i) == find_set(b, i))
				ans++;
		}
		printf("%d\n", ans);
	}

	return 0;
}
	  	  	 		 	 	 					  	  	  		