#include <bits/stdc++.h>
using namespace std;
const long long MOD = 1000000007;
long long A[202020], B[202020];
int main() {
  int N, Q;
  cin >> N >> Q;
  long long S = 0;
  for (int i = 0; i < (2 * N); i++) {
    cin >> A[i];
    S += A[i];
  }
  map<long long, int> p, m;
  long long T = 0;
  for (int i = 0; i < (2 * N); i++) {
    cin >> B[i];
    B[i] -= A[i];
    if (i != 0 && i != 2 * N - 1) {
      if (B[i] > 0) {
        p[B[i]]++;
        T += B[i];
      } else {
        m[-B[i]]++;
      }
    }
  }
  while (Q--) {
    long long i, x, y;
    cin >> i >> x >> y;
    i--;
    S -= A[i];
    if (i != 0 && i != 2 * N - 1) {
      if (B[i] > 0) {
        p[B[i]]--;
        if (p[B[i]] == 0) p.erase(B[i]);
        T -= B[i];
      } else {
        m[-B[i]]--;
        if (m[B[i]] == 0) m.erase(B[i]);
      }
    }
    A[i] = x;
    S += A[i];
    B[i] = y - x;
    if (i != 0 && i != 2 * N - 1) {
      if (B[i] > 0) {
        p[B[i]]++;
        T += B[i];
      } else {
        m[-B[i]]++;
      }
    }
    long long ans;
    if (p.size() % 2 == 0)
      ans = S + T;
    else {
      auto pp = p.begin(), mm = m.begin();
      ans = S + max(T - pp->first, T - mm->first);
    }
    cout << ans << endl;
  }
  return 0;
}
