B. Mr. Kitayuta's Colorful Graph（并查集）

B. Mr. Kitayuta's Colorful Graph

time limit per test

1 second

memory limit per test

256 megabytes

input

standard input

output

standard output

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_i, connecting vertex a_i and b_i.

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

In the i-th query, he gives you two integers — u_i and v_i.

Find the number of the colors that satisfy the following condition: the edges of that color connect vertex u_i and vertex v_i 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 — a_i, b_i (1 ≤ a_i < b_i ≤ n) and c_i (1 ≤ c_i ≤ 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_i, b_i, c_i) ≠ (a_j, b_j, c_j).

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_i and v_i (1 ≤ u_i, v_i ≤ n). It is guaranteed that u_i ≠ v_i.

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.

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.

题意：1-n个点，用不同颜色的绳子连接，求两点之间有几种绳子连接；如1--3用1号绳子，3--4用1号绳子， 3--5用2号绳子，则1--4有一种绳子，1--5没有绳子，因为1--3， 3--5绳子不同；

思路：并查集；

#include <stdio.h>
#include <string.h>
#include <stdlib.h>
#include <iostream>
#include <algorithm>
#include <math.h>
using namespace std;
int n, m;
int uset[105][105];              //和普通并查集一样，存祖先，不过uset[1][2]表示二号点用1号绳子连接的祖先；
int find(int c, int x){
    int p=x, t;
    while(uset[c][p]!=p) p=uset[c][p];
    while(x!=p){
        t=uset[c][x];
        uset[c][x]=p;
        x=uset[c][x];
    }
    return uset[c][x];
}
void unionSet(int c, int x, int y){
    int fx=find(c, x), fy=find(c, y);
    if(fx==fy) return;
    else uset[c][fy]=find(c, fx);
}
void UF(){
    int i, j;
    for(i=1; i<=m; i++)
        for(j=1; j<=n; j++)
            uset[i][j]=j;
}
int main(){
    scanf("%d%d",&n,&m);
    int i;
    int maxx;
    maxx=0;
    UF();
    for(i=1; i<=m; i++){
        int a, b, c;
        scanf("%d%d%d",&a,&b,&c);
        if(maxx<c) maxx=c;     //maxx表示一共几条绳子；
        unionSet(c, a, b);
    }
    int q;
    scanf("%d",&q);
    for(i=1; i<=q; i++){
        int a, b;
        scanf("%d%d",&a,&b);
        int j;
        int cnt=0;
        int fx, fy;
        for(j=1; j<=maxx; j++){     //每条绳子都遍历一遍；
            fx=find(j, a);
            fy=find(j, b);
            if(fx==fy) cnt++;
        }
        printf("%d\n",cnt);
    }
    return 0;
}