#include <bits/stdc++.h>
#include <atcoder/all>
using namespace std;
using namespace atcoder;

using ld = long double;
using ll = long long;
using ull = unsigned long long;
using VB = vector<bool>;
using VVB = vector<VB>;
using VC = vector<char>;
using VVC = vector<VC>;
using VI = vector<int>;
using VVI = vector<VI>;
using VVVI = vector<VVI>;
using VL = vector<ll>;
using VVL = vector<VL>;
using VVVL = vector<VVL>;
using VD = vector<ld>;
using VVD = vector<VD>;
using VT = vector<string>;
using VVT = vector<VT>;
using P = pair<ll, ll>;
using VP = vector<P>;

#define REP(i, n) for (int i = 0; i < (int)(n); i++)
#define FOR(i, a, b) for (ll i = a; i < (ll)(b); i++)
#define ALL(a) (a).begin(),(a).end()

constexpr int INF = 1001001001;
constexpr ll LINF = 1001001001001001001ll;
//constexpr ll LINF = 8e18;
//constexpr int DX[] = {-1, -1, 0, 0, 1, 1};
//constexpr int DY[] = {-1, 0, -1, 1, 0, 1};
constexpr int DX[] = {1, 0, -1, 0, 0, 0};
constexpr int DY[] = {0, 1, 0, -1, 0, 0};
//constexpr int DZ[] = {0, 0, 0,  0, 1, -1};

template< typename T1, typename T2>
inline bool chmax(T1 &a, T2 b) {return a < b && (a = b, true); }
template< typename T1, typename T2>
inline bool chmin(T1 &a, T2 b) {return a > b && (a = b, true); }

using mint = modint998244353;
//using mint = modint1000000007;
using VM = vector<mint>;
using VVM = vector<VM>;
using VVVM = vector<VVM>;
using VVVVM = vector<VVVM>;

inline ll divceil(ll x, ll y) {
    if(x >= 0) return (x + y - 1) / y;
    else return -((-x) / y);
}
inline ll divfloor(ll x, ll y) {
    if(x >= 0) return x / y;
    else return -((- x + y - 1) / y);
}

int main() {
    ios::sync_with_stdio(false); 
    std::cin.tie(nullptr);
    int h, w, sx, sy, n;
    cin >> h >> w >> sx >> sy >> n;
    VI x(n + 1, sx), y(n + 1, sy), c(n + 1, 0);
    REP(i, n) cin >> x[i + 1] >> y[i + 1] >> c[i + 1];
    VL dp(n + 1, -LINF);
    dp[0] = 0;
    REP(i, n) {
        if (x[i] == x[i + 1] || y[i] == y[i + 1] || x[i] + y[i] == x[i + 1] + y[i + 1] || x[i] - y[i] == x[i + 1] - y[i + 1]) chmax(dp[i + 1], dp[i] + c[i + 1]);
        if (i < n - 1) chmax(dp[i + 2], dp[i] + c[i + 2]);
    }
    cout << max(dp[n], dp[n - 1]) << endl;
}