Mr. Kitayuta's Colorful Graph

Mr. Kitayuta has just bought an undirected graph consisting of n vertices and medges. 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.

#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
int map[110][110][110];//开三维数组储存u到v之间能靠一条线连通标记为1
int main()
{
    int n,m,a,b,c,u,v;
    scanf("%d %d",&n,&m);
    memset(map,0,sizeof(map));
    for(int i=1;i<=m;i++)
    {
        scanf("%d %d %d",&a,&b,&c);
        map[a][b][c]=1;
        map[b][a][c]=1;
    }
    for(int i=1;i<=m;i++)
    {
        for(int j=1;j<=n;j++)
        {
            for(int k=1;k<=n;k++)
            {
                for(int s=1;s<=n;s++)
                {
                    if(map[k][j][i]&&map[j][s][i])
                    {
                        map[k][s][i]=1;
                        map[s][k][i]=1;
                    }
                }
            }
        }
    }
    int q;
    scanf("%d",&q);
    while(q--)
    {
        int ans=0;
        scanf("%d %d",&u,&v);
        for(int i=1;i<=m;i++)
        {
            ans+=map[u][v][i];//统计总数量
        }
        printf("%d\n",ans);
    }
    return 0;
}