#include <bits/stdc++.h>
using namespace std;
struct SegmentTree {
  long long n;
  vector<long long> data;
  vector<long long> num;
  vector<long long> minusmax;
  vector<long long> plusmin;
  SegmentTree(long long _n) {
    n = 2;
    while (n < _n) n *= 2;
    data.resize(2 * n - 1, INT_MIN);
    num.resize(2 * n - 1, 0);
    minusmax.resize(2 * n - 1, INT_MIN);
    plusmin.resize(2 * n - 1, INT_MAX);
  }
  void set(long long pos, long long x) {
    pos += n - 1;
    data[pos] = x;
    if (x > 0) {
      num[pos] = 1;
      plusmin[pos] = x;
      minusmax[pos] = INT_MIN;
    } else {
      num[pos] = 0;
      minusmax[pos] = x;
      plusmin[pos] = INT_MAX;
    }
    while (pos > 0) {
      pos = (pos - 1) / 2;
      data[pos] = (max(0LL, data[2 * pos + 1]) + max(0LL, data[2 * pos + 2]));
      num[pos] = num[2 * pos + 1] + num[2 * pos + 2];
      minusmax[pos] = max(minusmax[2 * pos + 1], minusmax[2 * pos + 2]);
      plusmin[pos] = min(plusmin[2 * pos + 1], plusmin[2 * pos + 2]);
    }
  }
  long long getSum(long long l, long long r, long long a = 0, long long b = -1,
                   long long pos = 0) {
    if (b < 0) b = n;
    if (l >= b || r <= a) return 0;
    if (l <= a && r <= b) return max(0LL, data[pos]);
    return getSum(l, r, a, (a + b) / 2, pos * 2 + 1) +
           getSum(l, r, (a + b) / 2, b, pos * 2 + 2);
  }
  long long getNum(long long l, long long r, long long a = 0, long long b = -1,
                   long long pos = 0) {
    if (b < 0) b = n;
    if (l >= b || r <= a) return 0;
    if (l <= a && r <= b) return num[pos];
    return getNum(l, r, a, (a + b) / 2, pos * 2 + 1) +
           getNum(l, r, (a + b) / 2, b, pos * 2 + 2);
  }
  long long getMinusMax(long long l, long long r, long long a = 0,
                        long long b = -1, long long pos = 0) {
    if (b < 0) b = n;
    if (l >= b || r <= a) return INT_MIN;
    if (l <= a && r <= b) return minusmax[pos];
    return max(getMinusMax(l, r, a, (a + b) / 2, pos * 2 + 1),
               getMinusMax(l, r, (a + b) / 2, b, pos * 2 + 2));
  }
  long long getPlusMin(long long l, long long r, long long a = 0,
                       long long b = -1, long long pos = 0) {
    if (b < 0) b = n;
    if (l >= b || r <= a) return INT_MAX;
    if (l <= a && r <= b) return plusmin[pos];
    return min(getPlusMin(l, r, a, (a + b) / 2, pos * 2 + 1),
               getPlusMin(l, r, (a + b) / 2, b, pos * 2 + 2));
  }
  void printData() {
    cout << endl;
    for (long long i = 0; i < (long long)(n); i++)
      cout << n - 1 + i << " " << data[n - 1 + i] << endl;
    cout << endl;
  }
};
int main() {
  long long N, Q;
  cin >> N >> Q;
  long long ans = 0;
  long long a[2 * N], b[2 * N];
  for (long long i = 0; i < (long long)(2 * N); i++) cin >> a[i];
  for (long long i = 0; i < (long long)(2 * N); i++) cin >> b[i];
  if (N == 1) {
    while (Q--) {
      long long p, x, y;
      cin >> p >> x >> y;
      a[--p] = x;
      ans = a[0] + a[1];
      cout << ans << endl;
    }
  } else {
    for (long long i = 0; i < (long long)(2 * N); i++) ans += a[i];
    SegmentTree st(2 * N - 2);
    for (long long i = 0; i < (long long)(2 * N - 2); i++)
      st.set(i, b[i + 1] - a[i + 1]);
    while (Q--) {
      long long p, x, y;
      cin >> p >> x >> y;
      ans -= a[--p];
      a[p] = x;
      b[p] = y;
      ans += a[p];
      st.set(p - 1, y - x);
      long long res = ans + st.getSum(0, 2 * N - 2);
      if (st.getNum(0, 2 * N - 2) % 2 == 1) {
        res = max(res - st.getPlusMin(0, 2 * N - 2),
                  res + st.getMinusMax(0, 2 * N - 2));
      }
      cout << res << endl;
    }
  }
  return 0;
}
