Mr. Kitayuta's Colorful Graph

题目：

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.

 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.

题意：

有n个点和m条边，每条边都有各自的颜色，多次询问两点之间有多少种不同的颜色相连。

例子看Note；

 

思路：

开一个三维数组，其中一维表示路的颜色，其他两维表示两个点的编号，如d[c][a][b]表示点a与点b之间有一条颜色为c的路。

利用floyd算法即可。

 

代码：

#include<stdio.h>
#include<string.h>
int d[110][110][110];

int main()
{
    int n,m;
    while(~scanf("%d%d", &n, &m))
    {
        int sum=0;
        memset(d, 0, sizeof(d));
        for(int i=1; i<=m; i++)
        {
            int a,b,c;
            scanf("%d%d%d", &a, &b, &c);
            d[c][a][b] = d[c][b][a] = 1;
        }
        for(int c = 1; c <= m; c++)
            for(int k = 1; k <= n; k++)
                for(int i = 1; i <= n; i++)
                    for(int j = 1; j <= n; j++)
                        if(d[c][i][j]==0)
                            d[c][i][j]=d[c][j][i]=(d[c][i][k]==1&&d[c][k][j]==1);
        int t;
        scanf("%d",&t);
        while(t--)
        {
            int a,b;
            sum = 0;
            scanf("%d%d", &a, &b);
            for(int c = 1; c <= m; c++)
                if(d[c][a][b]) sum++;
            printf("%d\n", sum);
        }
    }
    return 0;
}