#include <bits/stdc++.h>
using namespace std;
long long n, q, a[200010], b[200010];
map<long long, long long> mp;
void Erase(long long x) {
  mp[x]--;
  if (mp[x] == 0) mp.erase(x);
}
int main() {
  cin >> n >> q;
  for (int i = 0; i < 2 * n; i++) cin >> a[i];
  for (int i = 0; i < 2 * n; i++) cin >> b[i];
  long long sum = a[0] + a[2 * n - 1];
  long long cnt = 0;
  for (int i = 1; i <= 2 * n - 2; i++) {
    sum += max(a[i], b[i]);
    if (a[i] > b[i]) {
      mp[a[i] - b[i]]++;
      cnt++;
    } else
      mp[b[i] - a[i]]++;
  }
  for (int u = 0; u < q; u++) {
    long long p, x, y;
    cin >> p >> x >> y;
    p--;
    if (p == 0 || p == 2 * n - 1) {
      sum = sum - a[0] + x;
    } else {
      sum -= max(a[p], b[p]);
      sum += max(x, y);
      if (a[p] > b[p]) {
        Erase(a[p] - b[p]);
        cnt--;
      } else
        Erase(b[p] - a[p]);
      if (x > y) {
        mp[x - y]++;
        cnt++;
      } else
        mp[y - x]++;
    }
    a[p] = x, b[p] = y;
    long long ans = sum;
    if (cnt % 2 == 1) {
      ans -= mp.begin()->first;
    }
    cout << ans << endl;
  }
  return 0;
}
