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.HashSet;
import java.util.Set;
import java.util.StringTokenizer;

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);
		Task solver = new Task();
		solver.solve(1, in, out);
		out.close();
	}
}

class Task {
	
	class Pair {
		int from, to, color;
	}
	
	static final int MaxN = 110;
	
	Pair[] edge = new Pair[2*MaxN];
	Boolean[] visited = new Boolean[MaxN];
	Set<Integer> s = new HashSet<Integer>();
	int n, m;
	
	public void solve(int testNumber, InputReader in, PrintWriter out) {
		n = in.nextInt();
		m = in.nextInt();
		for(int i=0; i<m; ++i) {
			edge[i] = new Pair();
			edge[i].from = in.nextInt();
			edge[i].to = in.nextInt();
			edge[i].color = in.nextInt();
			edge[i+m] = new Pair();
			edge[i+m].from = edge[i].to;
			edge[i+m].to = edge[i].from;
			edge[i+m].color = edge[i].color;
		}
		int q = in.nextInt();
		for(int i=0; i<q; ++i) {
			int from = in.nextInt();
			int to = in.nextInt();
			for(int j=0; j<=n; ++j) visited[j] = false;
			s.clear();
			dfs(from, to, -1);
			out.println(s.size());
		}
	}
	
	void dfs(int from, int to, int lastcolor) {
		if(visited[from]) return;
		visited[from] = true;
		for(int i=0; i<2*m; ++i) {
			if(edge[i].from!=from) continue;
			if(edge[i].to==to) {
				if(edge[i].color==lastcolor || lastcolor==-1) s.add(edge[i].color);
			} else {
				dfs(edge[i].to, to, edge[i].color);
			}
		}
		visited[from] = false;
	}
}

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());
    }

}