H, W, sx, sy, N = map(int, input().split())
x = [sx]
y = [sy]
c = [0]
for _ in range(N):
    x_, y_, c_ = map(int, input().split())
    x.append(x_)
    y.append(y_)
    c.append(c_)

INF = 10 ** 18
dp = [-INF for _ in range(N + 1)]
dp[0] = 0
for i in range(1, N + 1):
    for j in range(1, 4):
        if i - j < 0:
            continue
        if j == 1:
            if x[i] == x[i - j] or y[i] == y[i - j] or x[i] + y[i] == x[i - j] + y[i - j] or x[i] - y[i] == x[i - j] - y[i - j]:
                dp[i] = max(dp[i], dp[i - j] + c[i])
        else:
            dp[i] = max(dp[i], dp[i - j] + c[i])
print(max(dp))