CodeForces - 505B 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，（ab用c连接），在输入q，接下来q行u，v，求u连接v有多少种方法（如果1，2用3连接，1，4用3连接，则2，4连接了）

• #include<stdio.h>
  #include<string.h>
  #include<algorithm>
  using namespace std;
  int f[110][110];
  int getf(int v,int u)
  {
      if(f[v][u]!=v)
          f[v][u]=getf(f[v][u],u);
      return f[v][u];
  }
  void mergee(int a,int b,int c)
  {
      int t1=getf(a,c),t2=getf(b,c);
      if(t1!=t2)
          f[t1][c]=t2;
  }
  int main()
  {
      int n,m;
      while(~scanf("%d%d",&n,&m))
      {
          int i,j;
          int a,b,c,q,u,v;
          for(i=1; i<=100; i++)
              for(j=1; j<=100; j++)
                  f[i][j]=i;
          for(i=1; i<=m; i++)
          {
              scanf("%d%d%d",&a,&b,&c);
              mergee(a,b,c);
          }
          scanf("%d",&q);
          for(i=0; i<q; i++)
          {
              int ans=0;
              scanf("%d%d",&u,&v);
              for(j=1; j<=m; j++)
                  if(getf(u,j)==getf(v,j))
                      ans++;
              printf("%d\n",ans);
          }
      }
      return 0;
  }