#include <bits/stdc++.h>
int a[200000], b[200000];
int main() {
  int n, q;
  scanf("%d %d", &n, &q);
  int i;
  long long suma = 0;
  for (i = 0; i < 2 * n; i++) {
    scanf("%d", &a[i]);
    suma += a[i];
  }
  for (i = 0; i < 2 * n; i++) {
    scanf("%d", &b[i]);
  }
  int p, x, y;
  int l, r;
  long long sum;
  for (i = 0; i < q; i++) {
    scanf("%d %d %d", &p, &x, &y);
    suma = suma + (long long)x - (long long)a[p - 1];
    a[p - 1] = x;
    b[p - 1] = y;
    l = 1;
    r = 2 * n - 2;
    sum = suma;
    while (true) {
      while (l < 2 * n && a[l] >= b[l]) {
        l++;
      }
      while (r >= 0 && a[r] >= b[r]) {
        r--;
      }
      if (l >= r) {
        break;
      }
      sum = sum - a[l] + b[l] - a[r] + b[r];
      l++;
      r--;
    }
    printf("%d\n", sum);
  }
  return 0;
}
