#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)

int main() {
    cin.tie(nullptr);
    ios_base::sync_with_stdio(false);
    int h, w, sx, sy, n;
    cin >> h >> w >> sx >> sy >> n;
    vector<ll> x(n + 1), y(n + 1), c(n + 1, 0);
    vector<ll> dp(n + 1, 0);
    x[0] = sx;
    y[0] = sy;
    ll ans = 0;
    ll mx = 0;
    for (int i = 1; i <= n; i++) {
        cin >> x[i] >> y[i] >> c[i];
        if (i != 1) {
            mx = max(dp[i - 2], mx);
            dp[i] = max(dp[i], mx + c[i]);
        }
        if (x[i - 1] == x[i] || y[i - 1] == y[i] || abs(x[i - 1] - x[i]) == abs(y[i - 1] - y[i])) {
            dp[i] = max(dp[i], dp[i - 1] + c[i]);
        }
        ans = max(ans, dp[i]);
    }
    cout << ans << endl;
    return 0;
}