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. 

<image> 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. 
2 1
1 2 1
1
1 2
 2 3
1 2 3
1 2 2
1 2 1
1
1 2
 2 5
1 2 1
1 2 2
1 2 3
1 2 4
1 2 5
1
1 2

1
 3
 5

#include<bits/stdc++.h>
using namespace std;
vector<pair<int,int>> graph[1001000];
vector<int> gcolor[1001000];
int vis[1001000];
int x1,y1;
int cnt=0;
void dfs(int node,int color){
    vis[node]=1;
    if(node==y1){
       //cout<<node<<" "<<color<<endl;
        cnt++;
        return;
    }else{
        for(auto xxx:graph[node]){
        //    cout<<"  **  "<<xxx.first<<" "<<xxx.second<<endl;
            if(!vis[xxx.first] && xxx.second==color){
          //      cout<<"  /**/  "<<xxx.first<<" "<<xxx.second<<endl;
                dfs(xxx.first,color);
                vis[xxx.first]=0;

            }
        }
    }
    return;
}
int main(){
    int n,m;
    cin>>n>>m;
    for(int i=0;i<m;i++){
        int x,y,color;
        cin>>x>>y>>color;
        graph[x].push_back(make_pair(y,color));
        graph[y].push_back(make_pair(x,color));
        gcolor[x].push_back(color);
        gcolor[y].push_back(color);
            auto it=std::unique(gcolor[x].begin(),gcolor[x].end());
            gcolor[x].resize(std::distance(gcolor[x].begin(),it));
            it=std::unique(gcolor[y].begin(),gcolor[y].end());
            gcolor[y].resize(std::distance(gcolor[y].begin(),it));
    }
    int q;
    cin>>q;
    while(q--){
        cin>>x1>>y1;
        cnt=0;
        memset(vis,0,sizeof(vis));
        for(auto xx: gcolor[x1]){
           //cout<<"xx=="<<xx<<endl;
            dfs(x1,xx);
        }
        cout<<cnt<<endl;
    }
}
