Problem: In a magical land there are n cities conveniently numbered 1, 2, ..., n. Some pairs of these cities are connected by magical colored roads. Magic is unstable, so at any time, new roads may appear between two cities.

Vicky the witch has been tasked with performing deliveries between some pairs of cities. However, Vicky is a beginner, so she can only complete a delivery if she can move from her starting city to her destination city through a double rainbow. A double rainbow is a sequence of cities c_1, c_2, ..., c_k satisfying the following properties:

  * For each i with 1 ≤ i ≤ k - 1, the cities c_i and c_{i + 1} are connected by a road. 
  * For each i with 1 ≤ i ≤ (k - 1)/(2), the roads connecting c_{2i} with c_{2i - 1} and c_{2i + 1} have the same color. 



For example if k = 5, the road between c_1 and c_2 must be the same color as the road between c_2 and c_3, and the road between c_3 and c_4 must be the same color as the road between c_4 and c_5.

Vicky has a list of events in chronological order, where each event is either a delivery she must perform, or appearance of a new road. Help her determine which of her deliveries she will be able to complete.

Input

The first line contains four integers n, m, c, and q (2 ≤ n ≤ 10^5, 1 ≤ m, c, q ≤ 10^5), denoting respectively the number of cities, the number of roads initially present, the number of different colors the roads can take, and the number of events.

Each of the following m lines contains three integers x, y, and z (1 ≤ x, y ≤ n, 1 ≤ z ≤ c), describing that there initially exists a bidirectional road with color z between cities x and y.

Then q lines follow, describing the events. Each event is one of the following two types: 

  1. + x y z (1 ≤ x, y ≤ n, 1 ≤ z ≤ c), meaning a road with color z appears between cities x and y; 
  2. ? x y (1 ≤ x, y ≤ n), meaning you should determine whether Vicky can make a delivery starting at city x and ending at city y. It is guaranteed that x ≠ y. 



It is guaranteed that at any moment, there is at most one road connecting any pair of cities, and that no road connects a city to itself. It is guaranteed that the input contains at least one event of the second type.

Output

For each event of the second type, print a single line containing "Yes" (without quotes) if the delivery can be made, or a single line containing "No" (without quotes) otherwise.

Example

Input


4 3 2 4
1 2 1
2 3 1
3 4 2
? 1 4
? 4 1
+ 3 1 2
? 4 1


Output


Yes
No
Yes

Note

The following picture corresponds to the sample.

<image>

For her first delivery, Vicky can use the sequence 1, 2, 3, 4 which is a double rainbow. However, she cannot complete the second delivery, as she can only reach city 3. After adding the road between cities 1 and 3, she can now complete a delivery from city 4 to city 1 by using the double rainbow 4, 3, 1.

Solution (in CPP):

Solution:
#include <bits/stdc++.h>
using namespace std;
const int MAXN = 1e5 + 5;
const int MAXBIG = 6e3;
const int DEG = 35;
struct edge {
  int u, v, clr;
};
int N, M, C, Q;
char cmd[MAXN];
int deg[MAXN], idx[MAXN];
vector<edge> roads;
vector<pair<int, int> > queries;
int dad[MAXN], rnk[MAXN];
bitset<MAXBIG> has[MAXN];
unordered_map<int, int> who[MAXN];
vector<int> adj[MAXN];
void add_road(int x, int y, int z) {
  roads.push_back({x, y, z});
  deg[x]++;
  deg[y]++;
}
void load() {
  scanf("%d%d%d%d", &N, &M, &C, &Q);
  for (int i = 0; i < M; i++) {
    int x, y, z;
    scanf("%d%d%d", &x, &y, &z);
    add_road(x, y, z);
  }
  for (int i = 0; i < Q; i++) {
    int x, y, z;
    scanf(" %c%d%d", cmd + i, &x, &y);
    if (cmd[i] == '+') {
      scanf("%d", &z);
      add_road(x, y, z);
    } else
      queries.push_back({x, y});
  }
}
int find(int x) { return dad[x] == x ? x : dad[x] = find(dad[x]); }
void join(int x, int y) {
  x = find(x);
  y = find(y);
  if (x == y) return;
  if (rnk[x] > rnk[y]) swap(x, y);
  dad[x] = y;
  rnk[y] += rnk[x] == rnk[y];
  has[y] |= has[x];
}
void merge(int x, int y, int c) {
  for (int i = 0; i < 2; i++) {
    adj[x].push_back(y);
    if (deg[y] > DEG) has[find(x)].set(idx[y]);
    int &ref = who[x][c];
    if (ref)
      join(ref, y);
    else
      ref = y;
    swap(x, y);
  }
}
void advance() {
  merge(roads.back().u, roads.back().v, roads.back().clr);
  roads.pop_back();
}
bool query(int x, int y) {
  int comp = find(x);
  if (find(y) == comp) return true;
  if (deg[y] > DEG) return has[comp].test(idx[y]);
  for (auto it : adj[y])
    if (find(it) == comp) return true;
  return false;
}
void solve() {
  reverse(roads.begin(), roads.end());
  reverse(queries.begin(), queries.end());
  int ptr = 0;
  for (int i = 1; i <= N; i++) {
    dad[i] = i;
    if (deg[i] > DEG) {
      idx[i] = ptr++;
      has[i].set(idx[i]);
    }
  }
  while (M--) advance();
  for (int i = 0; i < Q; i++)
    if (cmd[i] == '?') {
      puts(query(queries.back().first, queries.back().second) ? "Yes" : "No");
      queries.pop_back();
    } else
      advance();
}
int main() {
  load();
  solve();
  return 0;
}