#include <bits/stdc++.h>
using namespace std;
template <typename T, typename U>
inline void smin(T &a, const U &b) {
  if (a > b) a = b;
}
template <typename T, typename U>
inline void smax(T &a, const U &b) {
  if (a < b) a = b;
}
template <class T>
inline void gn(T &first) {
  char c, sg = 0;
  while (c = getchar(), (c > '9' || c < '0') && c != '-')
    ;
  for ((c == '-' ? sg = 1, c = getchar() : 0), first = 0; c >= '0' && c <= '9';
       c = getchar())
    first = (first << 1) + (first << 3) + c - '0';
  if (sg) first = -first;
}
template <class T1, class T2>
inline void gn(T1 &x1, T2 &x2) {
  gn(x1), gn(x2);
}
int power(int a, int b, int m, int ans = 1) {
  for (; b; b >>= 1, a = 1LL * a * a % m)
    if (b & 1) ans = 1LL * ans * a % m;
  return ans;
}
int root[100100];
int find(int u) { return root[u] == u ? u : root[u] = find(root[u]); }
unordered_map<int, int> adj[100100];
set<int> con[100100];
void add_edge(int u, int v, int c) {
  if (adj[u].count(c)) {
    int first = find(v);
    int second = find(adj[u][c]);
    if (first != second) {
      if (con[first].size() < con[second].size()) swap(first, second);
      for (auto z : con[second]) con[first].insert(z);
      root[second] = first;
    }
  } else
    adj[u][c] = v;
  con[find(v)].insert(u);
}
int main() {
  int n, m, c, q;
  gn(n, m), gn(c, q);
  for (int i = 1; i <= n; i++) root[i] = i;
  for (int i = 1; i <= m; i++) {
    int u, v, c;
    gn(u, v);
    gn(c);
    add_edge(u, v, c);
    add_edge(v, u, c);
  }
  char tp;
  int u, v;
  while (q--) {
    scanf(" %c", &tp);
    gn(u, v);
    if (tp == '+') {
      gn(c);
      add_edge(u, v, c);
      add_edge(v, u, c);
    } else {
      if (find(u) == find(v) || con[find(u)].count(v))
        puts("Yes");
      else
        puts("No");
    }
  }
  return 0;
}
