#include <bits/stdc++.h>
using namespace std;
const int N = 2e5 + 50, M = 6e5 + 50, K = 100;
int qx, qy, a[N], tr[M][K + 1];
int m, n, qs, qt, tag[M];
void build(int v, int l, int r) {
  for (int i = 1; i <= (K); ++i) tr[v][i] = i;
  if (l < r) {
    int mid = (l + r) >> 1;
    build(v << 1, l, mid);
    build(v << 1 ^ 1, mid + 1, r);
  }
}
void down(int v) {
  if (!tag[v]) return;
  for (int i = 1; i <= (K); ++i) {
    tr[v << 1][i] = tr[v][tr[v << 1][i]];
    tr[v << 1 ^ 1][i] = tr[v][tr[v << 1 ^ 1][i]];
  }
  for (int i = 1; i <= (K); ++i) tr[v][i] = i;
  tag[v << 1] = tag[v << 1 ^ 1] = 1, tag[v] = 0;
}
void update(int v, int l, int r) {
  if (r < qs || l > qt)
    return;
  else if (qs <= l && r <= qt) {
    tag[v] = 1;
    for (int i = 1; i <= (K); ++i)
      if (tr[v][i] == qx) tr[v][i] = qy;
    return;
  } else {
    int mid = (l + r) >> 1;
    down(v);
    update(v << 1, l, mid);
    update(v << 1 ^ 1, mid + 1, r);
  }
}
void print(int v, int l, int r) {
  if (l == r)
    printf("%d ", tr[v][a[l]]);
  else {
    int mid = (l + r) >> 1;
    down(v);
    print(v << 1, l, mid);
    print(v << 1 ^ 1, mid + 1, r);
  }
}
int main(int argc, char *argv[]) {
  scanf("%d", &n);
  for (int i = 1; i <= (n); ++i) scanf("%d", a + i);
  build(1, 1, n);
  scanf("%d", &m);
  while (m--) {
    scanf("%d%d%d%d", &qs, &qt, &qx, &qy);
    update(1, 1, n);
  }
  print(1, 1, n);
}
