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.

题意：每两个点之间有一种颜色连接，查询两个点，如果可以通过一种相同的颜色连接在一起，算一种路径，问有几种路径。

思路：并查集，不过这个这个是二维的。

代码：

#include<stdio.h>
#include<string.h>

int f[105][105];

int getf(int u,int v)
{
    if(f[u][v]==-1) return u;
    else {
        f[u][v]=getf(f[u][v],v);
        return f[u][v];
    }
}

void merge(int u,int v,int t)
{
    int t1,t2;
    t1=getf(u,t);
    t2=getf(v,t);
    if(t1!=t2)
        f[t2][t]=t1;  //t2与t1通过颜色t合并
}

int main()
{
    int n,m;
    while(~scanf("%d %d",&n,&m))
    {
        memset(f,-1,sizeof(f));
        int t1,t2,t3;
        for(int i=1;i<=m;i++)
        {
            scanf("%d %d %d",&t1,&t2,&t3);
            merge(t1,t2,t3);
        }
        int k;
        scanf("%d",&k);
        while(k--)
        {
            int x,y;
            scanf("%d %d",&x,&y);
            int sum=0;
            for(int i=1;i<=m;i++)
                if(getf(x,i)==getf(y,i)) //查询x,y能否通过颜色i连通
                  sum++;
            printf("%d\n",sum);
        }
    }
    return 0;
}