#include <bits/stdc++.h>
using namespace std;
template <class T1, class T2>
bool chmin(T1 &a, T2 b) {
  return b < a && (a = b, true);
}
template <class T1, class T2>
bool chmax(T1 &a, T2 b) {
  return a < b && (a = b, true);
}
using ll = long long;
using vll = vector<ll>;
using vvll = vector<vll>;
using P = pair<ll, ll>;
using ld = long double;
using vld = vector<ld>;
using vi = vector<int>;
using vvi = vector<vi>;
vll conv(vi &v) {
  vll r(v.size());
  for (long long i = 0; i < (long long)(v.size()); i++) r[i] = v[i];
  return r;
}
inline void input(int &v) {
  v = 0;
  char c = 0;
  int p = 1;
  while (c < '0' || c > '9') {
    if (c == '-') p = -1;
    c = getchar();
  }
  while (c >= '0' && c <= '9') {
    v = (v << 3) + (v << 1) + c - '0';
    c = getchar();
  }
  v *= p;
}
template <typename T, typename U>
ostream &operator<<(ostream &o, const pair<T, U> &v) {
  o << "(" << v.first << ", " << v.second << ")";
  return o;
}
template <size_t...>
struct seq {};
template <size_t N, size_t... Is>
struct gen_seq : gen_seq<N - 1, N - 1, Is...> {};
template <size_t... Is>
struct gen_seq<0, Is...> : seq<Is...> {};
template <class Ch, class Tr, class Tuple, size_t... Is>
void print_tuple(basic_ostream<Ch, Tr> &os, Tuple const &t, seq<Is...>) {
  using s = int[];
  (void)s{0, (void(os << (Is == 0 ? "" : ", ") << get<Is>(t)), 0)...};
}
template <class Ch, class Tr, class... Args>
auto operator<<(basic_ostream<Ch, Tr> &os, tuple<Args...> const &t)
    -> basic_ostream<Ch, Tr> & {
  os << "(";
  print_tuple(os, t, gen_seq<sizeof...(Args)>());
  return os << ")";
}
ostream &operator<<(ostream &o, const vvll &v) {
  for (long long i = 0; i < (long long)(v.size()); i++) {
    for (long long j = 0; j < (long long)(v[i].size()); j++)
      o << v[i][j] << " ";
    o << endl;
  }
  return o;
}
template <typename T>
ostream &operator<<(ostream &o, const vector<T> &v) {
  o << '[';
  for (long long i = 0; i < (long long)(v.size()); i++)
    o << v[i] << (i != v.size() - 1 ? ", " : "");
  o << "]";
  return o;
}
template <typename T>
ostream &operator<<(ostream &o, const set<T> &m) {
  o << '[';
  for (auto it = m.begin(); it != m.end(); it++)
    o << *it << (next(it) != m.end() ? ", " : "");
  o << "]";
  return o;
}
template <typename T>
ostream &operator<<(ostream &o, const unordered_set<T> &m) {
  o << '[';
  for (auto it = m.begin(); it != m.end(); it++)
    o << *it << (next(it) != m.end() ? ", " : "");
  o << "]";
  return o;
}
template <typename T, typename U>
ostream &operator<<(ostream &o, const map<T, U> &m) {
  o << '[';
  for (auto it = m.begin(); it != m.end(); it++)
    o << *it << (next(it) != m.end() ? ", " : "");
  o << "]";
  return o;
}
template <typename T, typename U, typename V>
ostream &operator<<(ostream &o, const unordered_map<T, U, V> &m) {
  o << '[';
  for (auto it = m.begin(); it != m.end(); it++) o << *it;
  o << "]";
  return o;
}
vector<int> range(const int x, const int y) {
  vector<int> v(y - x + 1);
  iota(v.begin(), v.end(), x);
  return v;
}
template <typename T>
istream &operator>>(istream &i, vector<T> &o) {
  for (long long j = 0; j < (long long)(o.size()); j++) i >> o[j];
  return i;
}
string bits_to_string(ll input, ll n = 64) {
  string s;
  for (long long i = 0; i < (long long)(n); i++)
    s += '0' + !!(input & (1ll << i));
  reverse((s).begin(), (s).end());
  return s;
}
template <typename T>
ostream &operator<<(ostream &o, const priority_queue<T> &v) {
  auto tmp = v;
  while (tmp.size()) {
    auto x = tmp.top();
    tmp.pop();
    o << x << " ";
  }
  o << endl;
  return o;
}
template <typename T>
unordered_map<T, ll> counter(vector<T> vec) {
  unordered_map<T, ll> ret;
  for (auto &&x : vec) ret[x]++;
  return ret;
};
string substr(string s, P x) { return s.substr(x.first, x.second - x.first); }
void vizGraph(vvll &g, int mode = 0, string filename = "out.png") {
  ofstream ofs("./out.dot");
  ofs << "digraph graph_name {" << endl;
  set<P> memo;
  for (long long i = 0; i < (long long)(g.size()); i++)
    for (long long j = 0; j < (long long)(g[i].size()); j++) {
      if (mode && (memo.count(P(i, g[i][j])) || memo.count(P(g[i][j], i))))
        continue;
      memo.insert(P(i, g[i][j]));
      ofs << "    " << i << " -> " << g[i][j]
          << (mode ? " [arrowhead = none]" : "") << endl;
    }
  ofs << "}" << endl;
  ofs.close();
  system(((string) "dot -T png out.dot >" + filename).c_str());
}
size_t random_seed;
namespace std {
using argument_type = P;
template <>
struct hash<argument_type> {
  size_t operator()(argument_type const &x) const {
    size_t seed = random_seed;
    seed ^= hash<ll>{}(x.first);
    seed ^= (hash<ll>{}(x.second) << 1);
    return seed;
  }
};
};  // namespace std
namespace myhash {
const int Bsizes[] = {3,  9,  13, 17, 21, 25, 29, 33, 37, 41,
                      45, 49, 53, 57, 61, 65, 69, 73, 77, 81};
const int xor_nums[] = {0x100007d1, 0x5ff049c9, 0x14560859, 0x07087fef,
                        0x3e277d49, 0x4dba1f17, 0x709c5988, 0x05904258,
                        0x1aa71872, 0x238819b3, 0x7b002bb7, 0x1cf91302,
                        0x0012290a, 0x1083576b, 0x76473e49, 0x3d86295b,
                        0x20536814, 0x08634f4d, 0x115405e8, 0x0e6359f2};
const int hash_key = xor_nums[rand() % 20];
const int mod_key = xor_nums[rand() % 20];
template <typename T>
struct myhash {
  std::size_t operator()(const T &val) const {
    return (hash<T>{}(val) % mod_key) ^ hash_key;
  }
};
};  // namespace myhash
template <typename T>
class uset : public std::unordered_set<T, myhash::myhash<T>> {
  using SET = std::unordered_set<T, myhash::myhash<T>>;

 public:
  uset() : SET() { SET::rehash(myhash::Bsizes[rand() % 20]); }
};
uint32_t randxor() {
  static uint32_t x = 1 + (uint32_t)random_seed, y = 362436069, z = 521288629,
                  w = 88675123;
  uint32_t t;
  t = (x ^ (x << 11));
  x = y;
  y = z;
  z = w;
  return (w = (w ^ (w >> 19)) ^ (t ^ (t >> 8)));
}
struct timeval start;
double sec() {
  struct timeval tv;
  gettimeofday(&tv, NULL);
  return (tv.tv_sec - start.tv_sec) + (tv.tv_usec - start.tv_usec) * 1e-6;
}
struct init_ {
  init_() {
    gettimeofday(&start, NULL);
    ios::sync_with_stdio(false);
    cin.tie(0);
    struct timeval myTime;
    struct tm *time_st;
    gettimeofday(&myTime, NULL);
    time_st = localtime(&myTime.tv_sec);
    srand(myTime.tv_usec);
    random_seed = RAND_MAX / 2 + rand() / 2;
  }
} init__;
static const double EPS = 1e-14;
static const long long INF = 1e18;
static const long long mo = 1e9 + 7;
vector<ll> correspondingParentheses(string &s) {
  vector<ll> ret(s.length(), -1);
  for (long long i = 0; i < (long long)(s.length()); i++) {
    if (ret[i] >= 0) continue;
    ll j;
    ll sum = 0;
    for (j = i; j < s.length(); j++) {
      sum += (s[j] == '(' ? 1 : -1);
      if (sum < 0) {
        ret[i] = -1;
        break;
      }
      if (sum == 0) {
        ret[i] = j, ret[j] = i;
        break;
      }
    }
    if (j == s.length()) ret[i] = -2;
  }
  return ret;
}
bool isValidParentheses(string &s) {
  ll counter = 0;
  for (long long i = 0; i < (long long)(s.length()); i++)
    if ((counter += (s[i] == '(' ? 1 : -1)) < 0) return false;
  return counter == 0;
}
ll countOpenParentheses(string &s) {
  ll sum = 0;
  for (long long i = 0; i < (long long)(s.length()); i++) sum += s[i] == ')';
  return sum;
}
ll countClosingParentheses(string &s) {
  ll sum = 0;
  for (long long i = 0; i < (long long)(s.length()); i++) sum += s[i] == '(';
  return sum;
}
void numerateParentheses(int n, vector<ll> &q_next) {
  q_next.clear();
  if (n < 0 || n % 2) return;
  vector<ll> q;
  q_next.push_back(0);
  ll t = 0;
  while (t < n && !q_next.empty()) {
    q.swap(q_next);
    while (!q.empty()) {
      ll tmp = q.back();
      q.pop_back();
      if (__builtin_popcount(tmp) > t / 2) q_next.push_back(tmp);
      if (__builtin_popcount(tmp) < n / 2) q_next.push_back(tmp | (1ll << t));
    }
    t++;
  }
}
P getNeededParentheseNum(string &t) {
  ll balance = 0;
  ll open = 0, close = 0;
  for (long long i = 0; i < (long long)(t.size()); i++) {
    if (t[i] == '(') {
      if (balance + i >= t.size() - 1)
        close++, balance--;
      else
        balance++;
    } else {
      if (balance <= 0)
        open++, balance++;
      else
        balance--;
    }
  }
  return P(open, close);
}
int main(void) {
  ll n, q;
  cin >> n >> q;
  assert(n <= 5);
  assert(q <= 10);
  n *= 2;
  vector<string> ss;
  for (long long mask1 = 0; mask1 < (long long)(1ll << (n)); mask1++) {
    string s;
    for (long long i = 0; i < (long long)(n); i++)
      s += (mask1 & (1ll << i)) ? '(' : ')';
    if (!isValidParentheses(s)) continue;
    ss.push_back(s);
  }
  ll m = ss.size();
  vll a(n), b(n);
  cin >> a >> b;
  for (long long _ = 0; _ < (long long)(q); _++) {
    ll p;
    cin >> p;
    p--;
    cin >> a[p] >> b[p];
    ll ret = -INF;
    for (long long i = 0; i < (long long)(m); i++)
      for (long long j = 0; j < (long long)(m); j++) {
        ll score = 0;
        string &s = ss[i];
        string &t = ss[j];
        for (long long k = 0; k < (long long)(n); k++) {
          if (s[k] == t[k]) {
            score += a[k];
          } else {
            score += b[k];
          }
        }
        if (ret < score) {
          ret = score;
        }
        chmax(ret, score);
      }
    cout << ret << endl;
  }
  return 0;
}
