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条边，之后m行每行三个数a，b，c代表节点a和节点b之间用c颜色的线连起来，这样构成一个图，然后给出一个数字t，下面t行每行两个数，p，q，问从p能否通过一种颜色的线到q，如果能的话，输出颜色数。

思路：从图字我们可以看出来，除了根节点每个节点都可以用一根颜色的线跟它的父结点连起来，若 p 能通过颜色为 c 的线到q，意思就是 p 能通过颜色 c 到达的根节点与 q 能通过颜色 c 到达的根节点是同一个根节点，于是这个题用并查集去做，找到 p用颜色 c 连接的根节点和 q 用颜色c连接的根节点，找到根节点之后返回二者根节点的序号，在主函数中用m种颜色便利，如果p，q能用相同颜色的线得到相同的根节点，那么颜色数加1，最后输出即可，代码如下：

#include<stdio.h>//每一个节点上面都有一跟线连着
#include<string.h>
int f[110][110];
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 c)
{
    int t1=getf(u,c);  //找到结点u用c色线连接的根节点
    int t2=getf(v,c);
    if(t1!=t2)
        f[t2][c]=t1; //靠左法则
}
int main()
{
    int i,j,n,m,t,p,q,sum,a,b,c;
    while(~scanf("%d %d",&n,&m))
    {
        memset(f,-1,sizeof(f));
        for(i=0; i<m; i++)
        {
            scanf("%d %d %d",&a,&b,&c);
            merge(a,b,c);
        }
        scanf("%d",&t);
        for(i=0;i<t;i++)
        {
            sum=0;
            scanf("%d %d",&p,&q);
            for(j=1;j<=m;j++)  //最多m种颜色
            {
                if(getf(p,j)==getf(q,j)) // p,q能用相同颜色的线找到相同节点则加一
                    sum++;
            }
            printf("%d\n",sum);
        }
    }
    return 0;
}