Mr. Kitayuta has just bought an undirected graph with 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 ≤ 105, 1 ≤ m ≤ 105), 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 ≤ 105), 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. 
import java.io.*;
import java.util.*;
public class CF505B
{
    static class conn
    {
        int v;
        int c;
        conn(int x,int y)
        {
            v=x;
            c=y;
        }
    }
    static LinkedList<conn> ll[];
    static boolean[] visited;
    static long count;
    public static void main(String[] args)throws IOException
    {
        BufferedReader br=new BufferedReader(new InputStreamReader(System.in));
        String t1=br.readLine();
        String[] t2=t1.split(" ");
        int n=Integer.parseInt(t2[0]);
        int m=Integer.parseInt(t2[1]);
        int[][] e=new int[m][3];
        ll=new LinkedList[n+1];
        for(int i=1;i<=n;i++)
        {
            ll[i]=new LinkedList<>();
        }
        for(int i=0;i<m;i++)
        {
            String t3=br.readLine();
            String[] t4=t3.split(" ");
            e[i][0]=Integer.parseInt(t4[0]);
            e[i][1]=Integer.parseInt(t4[1]);
            e[i][2]=Integer.parseInt(t4[2]);
            conn temp=new conn(e[i][1],e[i][2]);
            ll[e[i][0]].add(temp);
            temp=new conn(e[i][0],e[i][2]);
            ll[e[i][1]].add(temp);
        }
        visited=new boolean[n+1];
        Arrays.fill(visited,false);
        int q=Integer.parseInt(br.readLine());
        for(int j=0;j<q;j++)
        {
            String t5=br.readLine();
            String[] t6=t5.split(" ");
            int ui=Integer.parseInt(t6[0]);
            int vi=Integer.parseInt(t6[1]);
            count=0;
            long tt=0;
            HashSet<Integer> colors=new HashSet<>();
            for(conn y:ll[ui])
            {
                if(colors.contains(y.c))
                {
                    continue;
                }
                Arrays.fill(visited,false);
                visited[ui]=true;
                DFS(ui,vi,y.v,y.c);
                if(count!=tt)
                {
                    colors.add(y.c);
                    tt=count;
                }
            }
            System.out.println(count);
        }
    }

    public static void DFS(int start,int end,int node,int color)
    {
        if(end==node)
        {
            count++;
        }
        visited[node]=true;
        for(conn x:ll[node])
        {
            if(visited[x.v]==false)
            {
                if(x.c==color)
                {
                    DFS(start,end,x.v,color);
                }
            }
        }
    }
}