CodeForces

B. Mr. Kitayuta's Colorful Graph

time limit per test

1 second

memory limit per test

256 megabytes

input

standard input

output

standard output

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 51 2 11 2 22 3 12 3 32 4 331 23 41 4

output

210

input

5 71 5 12 5 13 5 14 5 11 2 22 3 23 4 251 55 12 51 51 4

output

11112

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 <iostream>#include <cstdio>#include <algorithm>#include <cstring>#include <queue>#include <stack>#include <vector>#define max_ 110#define inf 0x3f3f3f3f#define ll long longusing namespace std;int pre[max_][max_];int n,m;int find(int x,int t){return pre[t][x]==x?x:find(pre[t][x],t);}void join(int x,int y,int t){x=find(x,t);y=find(y,t);if(x!=y)pre[t][x]=y;}int main(int argc, char const *argv[]){scanf("%d%d",&n,&m);int i,j,r=m;for(i=1;i<max_;i++)for(j=1;j<max_;j++)pre[i][j]=j;while(m--){int x,y,t;scanf("%d%d%d",&x,&y,&t);join(x,y,t);}int q;scanf("%d",&q);while(q--){int u,v;scanf("%d%d",&u,&v);int cnt=0;for(i=1;i<=r;i++){if(find(u,i)==find(v,i))cnt++;}printf("%d\n",cnt);}return 0;}