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.

这道题的意思：给你一个路线带颜色的图，然后让你计算两点之间有多少不同颜色的道路，刚开始用了并查集写了一遍结果错了，后来发现他也不需要求路径的长短，只需要告诉他有多少条就好了，于是就想起来最短路的floyd 算法，但是颜色记录的话就开了一个三维的数组，然后按着floyd 写发现和答案有出入，于是把floyd 改了一下，不记录长度，记录数目。只要存在路就定为1

最后再用for循环进行遍历。

#include<stdio.h>
#include<string.h>
#include<algorithm>
using namespace std;
int a[110][110][110];
int main()
{
    int n,m;
    while(~scanf("%d%d",&n,&m))
    {
        int x,y,z;
        memset(a,0,sizeof(a));
        for(int i=1; i<=m; i++)
        {
            scanf("%d%d%d",&x,&y,&z);
            a[z][x][y]=a[z][y][x]=1;
        }
        for(int w = 1; w <= m; ++w)
            for(int k = 1; k <= n; ++k)
                for(int i = 1; i <= n; ++i)
                    for(int j = 1; j <= n; ++j)
                        if(a[w][i][j]==0)
                        {
                            if(a[w][i][k]&&a[w][k][j])
                                a[w][i][j]=a[w][j][i]=1;
                            else
                                a[w][i][j]=a[w][j][i]=0;
                        }
        int u;
        scanf("%d",&u);
        while(u--)
        {
            int ans=0;
            scanf("%d%d",&x,&y);
            for(int w=1; w<=m; w++)
            {
                if(a[w][x][y])
                    ++ans;
            }
            printf("%d\n",ans);
        }
    }
    return 0;
}