Please subscribe to the official Codeforces channel in Telegram via the link: https://t.me/codeforces_official.
×

Virtual contest is a way to take part in past contest, as close as possible to participation on time. It is supported only ACM-ICPC mode for virtual contests.
If you've seen these problems, a virtual contest is not for you - solve these problems in the archive.
If you just want to solve some problem from a contest, a virtual contest is not for you - solve this problem in the archive.
Never use someone else's code, read the tutorials or communicate with other person during a virtual contest.

No tag edit access

G. Shortest Path Queries

time limit per test

3.5 secondsmemory limit per test

512 megabytesinput

standard inputoutput

standard outputYou are given an undirected connected graph with weighted edges. The length of some path between two vertices is the bitwise xor of weights of all edges belonging to this path (if some edge is traversed more than once, then it is included in bitwise xor the same number of times).

There are three types of queries you have to process:

- 1
*x**y**d*— add an edge connecting vertex*x*to vertex*y*with weight*d*. It is guaranteed that there is no edge connecting*x*to*y*before this query; - 2
*x**y*— remove an edge connecting vertex*x*to vertex*y*. It is guaranteed that there was such edge in the graph, and the graph stays connected after this query; - 3
*x**y*— calculate the length of the shortest path (possibly non-simple) from vertex*x*to vertex*y*.

Print the answers for all queries of type 3.

Input

The first line contains two numbers *n* and *m* (1 ≤ *n*, *m* ≤ 200000) — the number of vertices and the number of edges in the graph, respectively.

Then *m* lines follow denoting the edges of the graph. Each line contains three integers *x*, *y* and *d* (1 ≤ *x* < *y* ≤ *n*, 0 ≤ *d* ≤ 2^{30} - 1). Each pair (*x*, *y*) is listed at most once. The initial graph is connected.

Then one line follows, containing an integer *q* (1 ≤ *q* ≤ 200000) — the number of queries you have to process.

Then *q* lines follow, denoting queries in the following form:

- 1
*x**y**d*(1 ≤*x*<*y*≤*n*, 0 ≤*d*≤ 2^{30}- 1) — add an edge connecting vertex*x*to vertex*y*with weight*d*. It is guaranteed that there is no edge connecting*x*to*y*before this query; - 2
*x**y*(1 ≤*x*<*y*≤*n*) — remove an edge connecting vertex*x*to vertex*y*. It is guaranteed that there was such edge in the graph, and the graph stays connected after this query; - 3
*x**y*(1 ≤*x*<*y*≤*n*) — calculate the length of the shortest path (possibly non-simple) from vertex*x*to vertex*y*.

It is guaranteed that at least one query has type 3.

Output

Print the answers for all queries of type 3 in the order they appear in input.

Example

Input

5 5

1 2 3

2 3 4

3 4 5

4 5 6

1 5 1

5

3 1 5

1 1 3 1

3 1 5

2 1 5

3 1 5

Output

1

1

2

Codeforces (c) Copyright 2010-2018 Mike Mirzayanov

The only programming contests Web 2.0 platform

Server time: Dec/09/2018 23:45:48 (d1).

Desktop version, switch to mobile version.

Supported by

User lists

Name |
---|