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.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.math.BigInteger;
import java.util.*;
import java.text.DecimalFormat;

public class Tree {
   
   
    static class InputReader {
 
		private final InputStream stream;
		private final byte[] buf = new byte[8192];
		private int curChar, snumChars;
 
		public InputReader(InputStream st) {
			this.stream = st;
		}
 
		public int read() {
			if (snumChars == -1)
	 			throw new InputMismatchException();
			if (curChar >= snumChars) {
				curChar = 0;
				try {
					snumChars = stream.read(buf);
				} catch (IOException e) {
					throw new InputMismatchException();
				}
				if (snumChars <= 0)
					return -1;
			}
			return buf[curChar++];
		}
 
		public int ni() {
			int c = read();
			while (isSpaceChar(c)) {
				c = read();
			}
			int sgn = 1;
			if (c == '-') {
				sgn = -1;
				c = read();
			}
			int res = 0;
			do {
				res *= 10;
				res += c - '0';
				c = read();
			} while (!isSpaceChar(c));
			return res * sgn;
		}
 
		public long nl() {
			int c = read();
			while (isSpaceChar(c)) {
				c = read();
			}
			int sgn = 1;
			if (c == '-') {
				sgn = -1;
				c = read();
			}
			long res = 0;
			do {
				res *= 10;
				res += c - '0';
				c = read();
			} while (!isSpaceChar(c));
			return res * sgn;
		}
 
		public int[] nia(int n) {
			int a[] = new int[n];
			for (int i = 0; i < n; i++) {
				a[i] = ni();
			}
			return a;
		}
 
		public String rs() {
			int c = read();
			while (isSpaceChar(c)) {
				c = read();
			}
			StringBuilder res = new StringBuilder();
			do {
				res.appendCodePoint(c);
				c = read();
			} while (!isSpaceChar(c));
			return res.toString();
		}
 
		public String nextLine() {
			int c = read();
			while (isSpaceChar(c))
				c = read();
			StringBuilder res = new StringBuilder();
			do {
				res.appendCodePoint(c);
				c = read();
			} while (!isEndOfLine(c));
			return res.toString();
		}
 
		public boolean isSpaceChar(int c) {
			return c == ' ' || c == '\n' || c == '\r' || c == '\t' || c == -1;
		}
 
		private boolean isEndOfLine(int c) {
			return c == '\n' || c == '\r' || c == -1;
		}
 
	}
    static PrintWriter w = new PrintWriter(System.out);
   
   
    static ArrayList<Integer> edge[];
    
    static ArrayList<Integer> color[][];
    static PriorityQueue<Integer> pq[];
    static long mod=1000000007;
    static double num=0;
    public static void bfs(ArrayList<Integer> arr[],boolean visited[],int root){
         
      
    } 
    
    static int min=Integer.MAX_VALUE;
    static boolean visited[];
    public static boolean dfs(int i,int v,int col,boolean visited[],int parent){
      visited[i]=true;
        if(i==v)
          return true;
      else{
            boolean count=false;
          Iterator itr=edge[i].iterator();
          while(itr.hasNext()){
              int a=(int)itr.next();
              if(color[i][a].contains(col)&&!visited[a]&&a!=parent){
                  
                  count |=dfs(a,v,col,visited,i);
              }
          }
           return count;  
      }
           
    
    }
    public static void main(String[] args) {
         InputReader sc=new InputReader(System.in);
     DecimalFormat df=new DecimalFormat("0.000000000000000");
        int n=sc.ni();
        int m=sc.ni();
        
      edge=new ArrayList[n+1];
      color=new ArrayList[n+1][n+1];
      for(int i=1;i<=n;i++){
          for(int j=1;j<=n;j++){
              color[i][j]=new ArrayList<Integer>();
          }
      }
      for(int i=1;i<=n;i++)
          edge[i]=new ArrayList<Integer>();
      for(int i=0;i<m;i++){
          int a=sc.ni();
          int  b=sc.ni();
          int c=sc.ni();
          color[a][b].add(c);
          color[b][a].add(c);
          if(!edge[a].contains(b))
             edge[a].add(b);
         if(!edge[b].contains(a))
             edge[b].add(a);
      }
      
      int q=sc.ni();
      while(q-->0){
         
          int ans=0;
          int u=sc.ni();
          int v=sc.ni();
          for(int i:edge[u]){
              for(int col:color[u][i]){
                  boolean visited[]=new boolean[n+1];
                  if(dfs(i,v,col,visited,u))
                      ans++;
              }
          }
          w.println(ans);
      }
      
        
        w.close();
    }
}
