#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using ld = long double;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using pci = pair<char, int>;
using vi = vector<int>;
using vll = vector<ll>;
using vpii = vector<pii>;
const ll infll = 1e18 + 3;
const int maxn = 1e6 + 77;
const int nmax = 1e6 + 577;
const ll basell = 1e18 + 3;
const ld eps = 1e-7;
const int inf = 1009000999;
const int nv = 100505;
const int baseint = 1000200013;
const ld PI = acos(-1.0);
inline bool EQ(ld a, ld b) { return fabs(a - b) < 1e-9; }
inline bool IF(int a, int b, int c) { return (a >= b && a <= c); }
inline bool IFS(int a, int b, int c) { return (a > b && a < c); }
template <typename T>
inline istream &operator>>(istream &_in, vector<T> &_v) {
  for (auto &_i : _v) {
    _in >> _i;
  }
  return _in;
}
pair<int, pii> a[2 * nv];
pii b[2 * nv];
int c[2 * nv];
int inline solve() {
  ios::sync_with_stdio(NULL), cin.tie(NULL), cout.tie(NULL);
  ;
  int n;
  cin >> n;
  for (int i = 0; i < n; ++i) {
    cin >> a[i].second.first;
    a[i].second.second = i;
    a[i].first = 0;
  }
  int q;
  cin >> q;
  int k = 0;
  for (int i = 0; i < q; ++i) {
    int t;
    cin >> t;
    if (t == 1) {
      int p, x;
      cin >> p >> x;
      p--;
      a[p].second.first = x;
      a[p].first = i;
    } else {
      int x;
      cin >> x;
      b[k].first = i;
      b[k].second = x;
      k++;
    }
  }
  if (k == 0) {
    for (int i = 0; i < n; ++i) {
      cout << a[i].second.first << " ";
    }
    return 0;
  }
  sort(a, a + n);
  sort(b, b + k);
  for (int i = k - 1; i >= 0; --i) {
    c[i] = max(c[i + 1], b[i].second);
  }
  int m = 0;
  for (int i = 0; i < n; ++i) {
    while (m < k && b[m].first < a[i].first) {
      m++;
    }
    if (a[i].second.first < c[m]) {
      a[i].second.first = c[m];
    }
    a[i].first = a[i].second.second;
  }
  sort(a, a + n);
  for (int i = 0; i < n; ++i) {
    cout << a[i].second.first << " ";
  }
  return 0;
}
int32_t main() {
  solve();
  return 0;
}
