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

import java.io.InputStream;
import java.io.InputStreamReader;
import java.io.BufferedReader;
import java.io.OutputStream;
import java.io.PrintWriter;
import java.io.IOException;
import java.util.StringTokenizer;

/**
 * FackBookCup A.problem Actual solution is at the top
 */
public class Main {
    public static void main(String[] args) {
        InputStream inputStream = System.in;
        OutputStream outputStream = System.out;
        InputReader in = new InputReader(inputStream);
        PrintWriter out = new PrintWriter(outputStream);
        TaskB solver = new TaskB();
        solver.solve(1, in, out);
        out.close();
    }
}

class TaskA {
    public void solve(int testNumber, InputReader in, PrintWriter out) {
        String str = in.next();
        for(int i=0;i<=str.length();i++)
        {
            String tmp=str.substring(0,i);
            String tmp1=str.substring(i,str.length());

            //System.out.println(tmp1);
            for(int j=0;j<26;j++)
            {
                String res=tmp+(char)('a'+j)+tmp1;
                //System.out.println(res);
                if(checkPalindrome(res))
                {
                    out.println(res);
                    return ;
                }
            }
        }
        out.println("NA");

    }

    public boolean checkPalindrome(String str) {
        boolean flag = true;
        for (int i = 0; i < str.length(); i++) {
            if (str.charAt(i) != str.charAt(str.length() - i - 1)) {
                flag = false;
            }

        }
        return flag;
    }
}
class TaskB {
    public void solve(int testNumber, InputReader in, PrintWriter out) {
        int array[][][]=new int[110][110][110];
        int n=in.nextInt();
        int m=in.nextInt();
        for(int i=0;i<m;i++){
            int a=in.nextInt();
            int b=in.nextInt();
            int c=in.nextInt();
            array[a-1][b-1][c-1]=1;
            array[b-1][a-1][c-1]=1;
        }
//      for(int i=0;i<n;i++)
//          for(int j=0;j<n;j++)
//          {
//              for(int k=0;k<n;k++)
//              {
//                  //System.out.print(array[i][j][k]);
//                  if(i==0&&j==1&&k==0)
//                  {
//                      System.out.println(array[i][j][k]);
//                  }
//              }
//              System.out.println();
//          }
        for(int k=0;k<n;k++)
        {
        for(int i=0;i<n;i++)
        {
            for(int j=0;j<n;j++)
            {
                for(int q=0;q<n;q++)
                {
                    if(i==k||j==k||i==j)
                        continue;
                    if(array[i][k][q]==1&&array[k][j][q]==1)
                   {
                        array[i][j][q]=1;
                        array[j][i][q]=1;
                    }
                }
            }
        }
        
        }
        int q=in.nextInt();
        for(int k=0;k<q;k++)
        {
            int a,b;
            a=in.nextInt();
            b=in.nextInt();
            int cnt=0;
            for(int i=0;i<n;i++)
                if(array[a-1][b-1][i]==1)
                {
                    cnt++;
                }
            out.println(cnt);
        }
        

    }

    
}

class InputReader {
    public BufferedReader reader;
    public StringTokenizer tokenizer;

    public InputReader(InputStream stream) {
        reader = new BufferedReader(new InputStreamReader(stream), 32768);
        tokenizer = null;
    }

    public String next() {
        while (tokenizer == null || !tokenizer.hasMoreTokens()) {
            try {
                tokenizer = new StringTokenizer(reader.readLine());
            } catch (IOException e) {
                throw new RuntimeException(e);
            }
        }
        return tokenizer.nextToken();
    }

    public int nextInt() {
        return Integer.parseInt(next());
    }

}