#include <bits/stdc++.h>
using namespace std;
constexpr int M = 998244353;
int add(int x, int y){x += y;return x >= M? x - M : x;}
int sub(int x, int y){x -= y;return x < 0? x + M : x;}
int mul(int x, int y){return static_cast<long long>(x) * y % M;}
void Or(int &a, int &b, int tg){b = tg == 1? add(b, a) : sub(b, a);}
void And(int &a, int &b, int tg){a = tg == 1? add(a, b) : sub(a, b);}
void Xor(int &a, int &b, int tg){tie(a, b) = make_pair(mul(add(a, b), tg), mul(sub(a, b), tg));}
int fpw(int x, int y){int ret = 1;for (; y; y >>= 1, x = mul(x, x))if (y & 1)ret = mul(ret, x);return ret;}
constexpr int half = M + 1 >> 1;
void trans(int *a, int n, bool rev, string o){
    for (int k = 1; k < n; k <<= 1){
        char c = o[__builtin_ctz(k)];
        for (int i = 0; i < n; i += k << 1)
            for (int j = 0; j < k; ++j){
                if (c == '|')Or(a[j + k], a[i + j + k], rev? -1 : 1);
                if (c == '&')And(a[j + k], a[i + j + k], rev? -1 : 1);
                if (c == '^')Xor(a[j + k], a[i + j + k], rev? half : 1);
            }
    }
}
int n, m, w; string o;
int det(int a[75][75], int n){
    int ret = 1; --n;//ignore last line and column
    for (int i = 0; i < n; ++i){
        int k = i;
        for (int j = i + 1; j < n; ++j)if (a[k][i])k = j;
        if (i ^ k)swap(a[i], a[k]), ret = sub(0, ret);
        if (!a[i][i])return 0;
        ret = mul(ret, a[i][i]);int inv = fpw(a[i][i], M - 2);
        for (int &v : a[i])v = mul(v, inv);
        for (int j = 0; j < n; ++j)if (j ^ i && a[j][i]){
            int sbv = a[j][i];
            for (int k = i; k < n; ++k)a[j][k] = sub(a[j][k], mul(a[i][k], sbv));
        }
    }
    return ret;
}
int a[75][75][1 << 12], ans[1 << 12];
int get(int x){
    static int v[75][75];
    for (int i = 0; i < n; ++i)
        for (int j = 0; j < n; ++j)v[i][j] = a[i][j][x];
    return det(v, n);
}
int main(){
    ios::sync_with_stdio(false), cin.tie(nullptr), cout.tie(nullptr);
    cin >> n >> m >> o;w = o.size();
    for (int i = 1, x, y, v; i <= m; ++i){
        cin >> x >> y >> v;if (--x == --y)continue;
        ++a[x][x][v];//++deg_x
        ++a[y][y][v];//++deg_y
        --a[x][y][v];--a[y][x][v];//link x->y
    }
    for (int i = 0; i < n; ++i)
        for (int j = 0; j < n; ++j)trans(a[i][j], 1 << w, 0, o);
    for (int i = 0; i < 1 << w; ++i)ans[i] = get(i);
    trans(ans, 1 << w, 1, o);
    int rs = rend(ans) - find_if(rbegin(ans), rend(ans), [](int x)->bool{
        return x;
    }) - 1;
    cout << rs << endl;
    return 0;
}
/*
3 3
^
1 2 1
2 3 1
1 3 1
*/