#include<bits/stdc++.h>

using namespace std;

typedef long long ll;

const int N = ;

const ll mod = ;

struct dsu {

    int fa[N * ];

    void ini(int n)

    {

        for(int i = ; i <= n; ++i)

            fa[i] = i;

    }

    int find(int x)

    {

        return x == fa[x] ? x : fa[x] = find(fa[x]);

    }

    void connect(int x, int y)

    {

        fa[find(x)] = find(y);

    }

    bool same(int x, int y)

    {

        return find(x) == find(y);

    }

} u;

int n, m, k, s = -;

int x[N], y[N], c[N];

ll ans;

bool flag[N * ];

ll power(ll x, ll t)

{

    ll ret = ;

    for(; t; t >>= , x = x * x % mod) if(t & ) ret = ret * x % mod;

    return ret;

}

void solve(int s)

{

    u.ini( * n +  * m + );

    u.connect(,  +  * n);

    u.connect(,  +  * n + );

    for(int i = ; i <= k; ++i)

    {

        int p = ;

        if(x[i] %  ==  && y[i] %  == ) p = ;

        p = p ^ c[i] ^ s;

        if(p)

        {

            u.connect(x[i] * , y[i] *  +  +  * n);

            u.connect(x[i] *  + , y[i] *  +  * n);

        }

        else

        {

            u.connect(x[i] * , y[i] *  +  * n);

            u.connect(x[i] *  + , y[i] *  +  * n + );

        }

    }

    int cnt = ;

    memset(flag, , sizeof(flag));

    for(int i = ; i <= n; ++i)

    {

        if(u.same(i * , i *  + ))

            return;

        if(!flag[u.find(i * )])

        {

            flag[u.find(i * )] = flag[u.find(i *  + )] = ;

            ++cnt;

        }

    }

    for(int i = ; i <= m; ++i)

    {

        if(u.same(i *  +  * n, i *  +  * n + ))

            return;

        if(!flag[u.find(i *  +  * n)])

        {

            flag[u.find(i *  +  * n)] = flag[u.find(i *  +  * n + )] = ;

            ++cnt;

        }

    }

    ans = (ans + power(2ll, cnt - )) % mod;

}

int main()

{

    scanf("%d%d%d", &n, &m, &k);

    for(int i = ; i <= k; ++i)

    {

        scanf("%d%d%d", &x[i], &y[i], &c[i]);

        if(x[i] ==  && y[i] == ) s = c[i];

    }

    if(s != ) solve();

    if(s != ) solve();

    printf("%lld\n", ans);

    return ;

}