#include <bits/stdc++.h>
using namespace std;
vector<pair<long long, long long> > amt;
vector<pair<long long, long long> > payoffs;
vector<long long> maximum_payoff;
int upper_bound(int ts) {
  int lo = 0;
  int ho = payoffs.size();
  int mid;
  while (lo < ho) {
    mid = (lo + ho) / 2;
    if (payoffs[mid].second > ts)
      ho = mid;
    else
      lo = mid + 1;
  }
  return lo;
}
int main() {
  int N;
  cin >> N;
  amt.resize(N);
  for (int i = 0; i < N; i++) {
    cin >> amt[i].first;
    amt[i].second = 0;
  }
  int Q;
  cin >> Q;
  int ts = 0;
  while (Q--) {
    int type;
    cin >> type;
    ts++;
    if (type == 1) {
      long long p, x;
      cin >> p >> x;
      amt[p - 1].first = x;
      amt[p - 1].second = ts;
    } else {
      long long x;
      cin >> x;
      payoffs.push_back(pair<long long, long long>(x, ts));
    }
  }
  int M = payoffs.size();
  if (M == 0) {
    for (int i = 0; i < N; i++) cout << amt[i].first << " ";
  } else {
    maximum_payoff.resize(M);
    maximum_payoff[M - 1] = payoffs[M - 1].first;
    for (int i = M - 2; i >= 0; i--)
      maximum_payoff[i] = ((payoffs[i].first) > (maximum_payoff[i + 1])
                               ? (payoffs[i].first)
                               : (maximum_payoff[i + 1]));
    int idx;
    for (int i = 0; i < N; i++) {
      idx = upper_bound(amt[i].second);
      if (idx < M)
        amt[i].first =
            ((amt[i].first) > (maximum_payoff[idx]) ? (amt[i].first)
                                                    : (maximum_payoff[idx]));
      cout << amt[i].first << " ";
    }
  }
  cout << "\n";
  return 0;
}
