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.
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.
For each query, print the answer in a separate line.
4 5 1 2 1 1 2 2 2 3 1 2 3 3 2 4 3 3 1 2 3 4 1 4
2 1 0
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
1 1 1 1 2
Let's consider 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<cstdio>
#include<cstring>
int vis[110][110][110];
int main()
{
int n,m,a,b,c;
while(~scanf("%d%d",&n,&m)) {
memset(vis,0,sizeof(vis));
for(int i=0;i<m;i++) {
scanf("%d%d%d",&a,&b,&c);
vis[a][b][c]=1;
vis[b][a][c]=1;
}
for(int i=1;i<=m;i++) {
for(int k=1;k<=n;k++) {
for(int a=1;a<=n;a++) {
for(int b=1;b<=n;b++) {
if(vis[a][k][i]&&vis[k][b][i]) {
vis[a][b][i]=vis[b][a][i]=1;
}
}
}
}
}
int q;
scanf("%d",&q);
for(int i=0;i<q;i++) {
scanf("%d%d",&a,&b);
int ans=0;
for(int j=1;j<=m;j++) {
if(vis[a][b][j]) {
ans++;
}
}
printf("%d\n",ans);
}
}
return 0;
}