#include <bits/stdc++.h>
using namespace std;
unsigned long xor128() {
  static unsigned long x = time(NULL), y = 362436069, z = 521288629,
                       w = 88675123;
  unsigned long t = (x ^ (x << 11));
  x = y;
  y = z;
  z = w;
  return (w = (w ^ (w >> 19)) ^ (t ^ (t >> 8)));
}
double dot(complex<double> a, complex<double> b) {
  return a.real() * b.real() + a.imag() * b.imag();
}
double gyaku_dot(complex<double> a, complex<double> b) {
  return a.real() * b.imag() - a.imag() * b.real();
}
double leng(complex<double> a) {
  return sqrt(a.real() * a.real() + a.imag() * a.imag());
}
double angles(complex<double> a, complex<double> b) {
  double cosine = dot(a, b) / (leng(a) * leng(b));
  double sine = gyaku_dot(a, b) / (leng(a) * leng(b));
  double kaku = acos(min((double)1.0, max((double)-1.0, cosine)));
  if (sine <= 0) {
    kaku = 2 * 3.141592653589793 - kaku;
  }
  return kaku;
}
vector<int> convex_hull(vector<complex<double>> a) {
  vector<int> ans;
  double now_minnest = a[0].real();
  int now_itr = 0;
  for (long long i = 0; i < a.size(); ++i) {
    if (now_minnest > a[i].real()) {
      now_minnest = a[i].real();
      now_itr = i;
    }
  }
  ans.push_back(now_itr);
  complex<double> ba(0, 1);
  while (true) {
    int now_go = 0;
    double now_min = 0;
    double now_length = 0;
    int starter = ans[ans.size() - 1];
    for (int i = 0; i < a.size(); ++i) {
      if (i != starter) {
        double goa = angles(ba, a[i] - a[starter]);
        if (goa - now_min >= 1e-5 ||
            (abs(goa - now_min) <= 1e-5 &&
             (abs(a[i] - a[starter]) - now_length) >= 1e-5)) {
          now_min = goa;
          now_go = i;
          now_length = abs(a[i] - a[starter]);
        }
      }
    }
    if (now_go == ans[0]) break;
    ans.push_back(now_go);
    ba = complex<double>(a[now_go] - a[starter]);
  }
  return ans;
}
pair<long long, long long> datas[500000];
int erased[500000];
int itr[500000];
int main() {
  long long n, query;
  cin >> n >> query;
  for (long long i = 0; i < 2 * n; ++i) {
    cin >> datas[i].first;
  }
  for (long long i = 0; i < 2 * n; ++i) {
    cin >> datas[i].second;
  }
  for (long long i = 0; i < 2 * n; ++i) {
    itr[i] = i;
  }
  priority_queue<pair<long long, long long>> next_loser;
  priority_queue<pair<long long, long long>, vector<pair<long long, long long>>,
                 greater<pair<long long, long long>>>
      next_winner;
  long long now_ans = 0;
  for (long long i = 0; i < 2 * n; ++i) {
    now_ans += datas[i].second;
  }
  now_ans += datas[0].first - datas[0].second;
  now_ans += datas[2 * n - 1].first - datas[2 * n - 1].second;
  long long now_cnt = 0;
  for (long long i = 1; i < 2 * n - 1; ++i) {
    long long geko = datas[i].first - datas[i].second;
    if (geko >= 0) {
      now_cnt++;
      next_winner.push(make_pair(geko, i));
      now_ans += geko;
    } else {
      next_loser.push(make_pair(geko, i));
    }
  }
  long long next_move = 2 * n;
  for (long long i = 0; i < query; ++i) {
    long long a, b, c;
    cin >> a >> b >> c;
    a--;
    if (a == 0 || a == 2 * n - 1) {
      now_ans -= datas[a].first;
      now_ans += b;
      datas[a] = make_pair(b, c);
      continue;
    }
    long long data_itr = itr[a];
    erased[data_itr] = 1;
    now_ans -= datas[data_itr].second;
    long long diff = datas[data_itr].first - datas[data_itr].second;
    if (diff >= 0) {
      now_cnt--;
      now_ans -= diff;
    } else {
    }
    while (next_winner.empty() == false &&
           erased[next_winner.top().second] == true) {
      next_winner.pop();
    }
    while (next_loser.empty() == false &&
           erased[next_loser.top().second] == true) {
      next_loser.pop();
    }
    data_itr = next_move;
    next_move++;
    itr[a] = data_itr;
    datas[data_itr] = make_pair(b, c);
    now_ans += datas[data_itr].second;
    diff = datas[data_itr].first - datas[data_itr].second;
    if (diff >= 0) {
      now_cnt++;
      now_ans += diff;
      next_winner.push(make_pair(diff, data_itr));
    } else {
      next_loser.push(make_pair(diff, data_itr));
    }
    if (now_cnt % 2 == 0) {
      cout << now_ans << endl;
    } else {
      long long geko = now_ans - next_winner.top().first;
      if (next_loser.empty() == false) {
        geko = max(geko, now_ans + next_loser.top().first);
      }
      cout << geko << endl;
    }
  }
}
