#include <bits/stdc++.h>
using namespace std;
const int Imx = 2147483647;
const long long Lbig = 2e18;
struct fastio {
  char s[100000];
  int it, len;
  fastio() { it = len = 0; }
  inline char get() {
    if (it < len) return s[it++];
    it = 0;
    len = fread(s, 1, 100000, stdin);
    if (len == 0)
      return EOF;
    else
      return s[it++];
  }
  bool notend() {
    char c = get();
    while (c == ' ' || c == '\n') c = get();
    if (it > 0) it--;
    return c != EOF;
  }
} _buff;
inline long long getnum() {
  long long r = 0;
  bool ng = 0;
  char c;
  c = _buff.get();
  while (c != '-' && (c < '0' || c > '9')) c = _buff.get();
  if (c == '-') ng = 1, c = _buff.get();
  while (c >= '0' && c <= '9') r = r * 10 + c - '0', c = _buff.get();
  return ng ? -r : r;
}
template <class T>
inline void putnum(T x) {
  if (x < 0) putchar('-'), x = -x;
  register short a[20] = {}, sz = 0;
  while (x) a[sz++] = x % 10, x /= 10;
  if (sz == 0) putchar('0');
  for (int i = sz - 1; i >= 0; i--) putchar('0' + a[i]);
}
inline char getreal() {
  char c = _buff.get();
  while (c <= 32) c = _buff.get();
  return c;
}
int mod;
long long qpow(long long x, long long k) {
  return k == 0 ? 1
                : 1ll * qpow(1ll * x * x % mod, k >> 1) * (k & 1 ? x : 1) % mod;
}
int n, m, k;
int sx[1011], sy[1011], cx[1011], cy[1011];
int main() {
  n = getnum(), m = getnum(), k = getnum();
  for (int i = 0; i < k; i++) {
    int x, y, v;
    x = getnum(), y = getnum(), v = getnum();
    x--;
    y--;
    sx[x] += v == -1;
    sy[y] += v == -1;
    cx[x]++;
    cy[y]++;
  }
  mod = getnum();
  bool ok = (n + m) % 2 == 0;
  for (int i = 0; i < n; i++) ok &= cx[i] < m || (sx[i] & 1);
  for (int i = 0; i < m; i++) ok &= cy[i] < n || (sy[i] & 1);
  if (!ok) {
    puts("0");
    return 0;
  }
  int cnt = (n - 1) * (m - 1) - k;
  for (int i = 0; i < n; i++) cnt += cx[i] == m;
  for (int i = 0; i < m; i++) cnt += cy[i] == n;
  cnt -= k == n * m;
  cout << qpow(2, cnt) % mod << endl;
  return 0;
}
