#include <bits/stdc++.h>
using namespace std;
const long long int N = 200005;
const long long int mod = 1e9 + 7;
long long int dp[1005], fact[N];
long long int power(long long int x, long long int n) {
  long long int res = 1;
  while (n > 0) {
    if (n % 2) res = (res * x) % mod;
    x = (x * x) % mod;
    n /= 2;
  }
  return res;
}
void factorial() {
  fact[0] = 1;
  fact[1] = 1;
  for (long long int i = 2; i <= 200000; i++) {
    fact[i] = (fact[i - 1] * i) % mod;
  }
}
long long int comb(long long int n, long long int k) {
  if (n < k) return 0;
  long long int ans = 1;
  ans = (ans * fact[n]) % mod;
  ans = (ans * power(fact[n - k], mod - 2)) % mod;
  ans = (ans * power(fact[k], mod - 2)) % mod;
  return ans % mod;
}
int32_t main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  factorial();
  long long int n;
  cin >> n;
  long long int a[n];
  long long int i, j, k;
  for (i = 0; i < n; i++) cin >> a[i];
  long long int q;
  cin >> q;
  while (q--) {
    long long int l, r;
    cin >> l >> r;
    l--;
    if (l == 0) {
      a[l + 1] += (a[l] - r);
    } else if (l == n - 1) {
      a[l - 1] += (r - 1);
    } else {
      a[l - 1] += (r - 1);
      a[l + 1] += (a[l] - r);
    }
    a[l] = 0;
  }
  for (i = 0; i < n; i++) cout << a[i] << "\n";
}
