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 c_i, connecting vertex a_i and b_i.

Mr. Kitayuta wants you to process the following q queries.

In the i-th query, he gives you two integers — u

Find the number of the colors that satisfy the following condition: the edges of that color connect vertex u_i and vertex v_i directly or indirectly.

Input

The first line of the input contains space-separated two integers — n and m (2 ≤ n ≤ 100, 1 ≤ m

The next m lines contain space-separated three integers — a_i, b_i (1 ≤ a_i < b_i ≤ n) and c_i (1 ≤ c_i ≤ 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

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 — u_i and v_i (1 ≤ u_i, v_i ≤ n). It is guaranteed that u_i ≠ v_i.

Output

For each query, print the answer in a separate line.

Examples

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

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<cstdio>
#include<cstring>
#include<iostream>
#include<algorithm>
#include<queue>
#include<stack>
#include<set>
#include<map>
#include<vector>
#include<cmath>

const int maxn=1e5+5;
typedef long long ll;
using namespace std;
struct node
{
    int v;
    int val;
};
int ans=0;
int vis[105];
vector<node>vec[105];
void bfs(int x,int y)
{
    node start;
    for(int j=1;j<=100;j++)
    {
    queue<node>q;
    memset(vis,0,sizeof(vis));
    vis[x]=1;
    for(int t=0;t<vec[x].size();t++)
    {
        if(vec[x][t].val==j&&vis[vec[x][t].v]==0)
        {
            q.push(vec[x][t]);
            vis[vec[x][t].v]=1;
        }
    }
    while(!q.empty())
    {
        node now=q.front();
        q.pop();
        if(now.v==y)
        {
            ans++;
        }
        for(int t=0;t<vec[now.v].size();t++)
        {
            if(vec[now.v][t].val==j&&vis[vec[now.v][t].v]==0)
            {
                vis[vec[now.v][t].v]=1;
                q.push(vec[now.v][t]);
            }
        }
    }
    }
}
int main()
{
    int n,m;
    cin>>n>>m;

    int a,b,c;
    set<int>s;
    for(int t=0;t<m;t++)
    {
        scanf("%d%d%d",&a,&b,&c);
        s.insert(c);
        node st;
        st.v=b;
        st.val=c;
        vec[a].push_back(st);
        st.v=a;
        st.val=c;
        vec[b].push_back(st);
    }
    int q;
    cin>>q;
    int uu,vv;
    for(int t=0;t<q;t++)
    {
        scanf("%d%d",&uu,&vv);
        ans=0;
        bfs(uu,vv);
        printf("%d\n",ans);
    }
    
    return 0;
}

CodeForces - 505B-Mr. Kitayuta's Colorful Graph(暴力)