#include<bits/stdc++.h>
#define For(i,a,b) for(int i=(a);i<=(b);++i)
#define Rep(i,a,b) for(int i=(a);i>=(b);--i)
#define ll long long
using namespace std;
inline int read()
{
	char c=getchar();int x=0;bool f=0;
	for(;!isdigit(c);c=getchar())f^=!(c^45);
	for(;isdigit(c);c=getchar())x=(x<<1)+(x<<3)+(c^48);
	if(f)x=-x;return x;
}

#define mod 998244353
struct modint{
	int x;
	modint(int o=0){x=o;}
	modint &operator = (int o){return x=o,*this;}
	modint &operator +=(modint o){return x=x+o.x>=mod?x+o.x-mod:x+o.x,*this;}
	modint &operator -=(modint o){return x=x-o.x<0?x-o.x+mod:x-o.x,*this;}
	modint &operator *=(modint o){return x=1ll*x*o.x%mod,*this;}
	modint &operator ^=(int b){
		modint a=*this,c=1;
		for(;b;b>>=1,a*=a)if(b&1)c*=a;
		return x=c.x,*this;
	}
	modint &operator /=(modint o){return *this *=o^=mod-2;}
	friend modint operator +(modint a,modint b){return a+=b;}
	friend modint operator -(modint a,modint b){return a-=b;}
	friend modint operator *(modint a,modint b){return a*=b;}
	friend modint operator /(modint a,modint b){return a/=b;}
	friend modint operator ^(modint a,int b){return a^=b;}
	friend bool operator ==(modint a,int b){return a.x==b;}
	friend bool operator !=(modint a,int b){return a.x!=b;}
	bool operator ! () {return !x;}
	modint operator - () {return x?mod-x:0;}
	bool operator <(const modint&b)const{return x<b.x;}
};
inline modint qpow(modint x,int y){return x^y;}

vector<modint> fac,ifac,iv;
inline void initC(int n)
{
	if(iv.empty())fac=ifac=iv=vector<modint>(2,1);
	int m=iv.size(); ++n;
	if(m>=n)return;
	iv.resize(n),fac.resize(n),ifac.resize(n);
	For(i,m,n-1){
		iv[i]=iv[mod%i]*(mod-mod/i);
		fac[i]=fac[i-1]*i,ifac[i]=ifac[i-1]*iv[i];
	}
}
inline modint C(int n,int m){
	if(m<0||n<m)return 0;
	return initC(n),fac[n]*ifac[m]*ifac[n-m];
}
inline modint sign(int n){return (n&1)?(mod-1):(1);}

#define fi first
#define se second
#define pb push_back
#define mkp make_pair
typedef pair<int,int>pii;
typedef vector<int>vi;

#define maxn 200005
#define inf 0x3f3f3f3f

int n,m;
vector<pii>e[maxn];

int fa[maxn],dep[maxn],sz[maxn],fe[maxn];
int dfn[maxn],que[maxn],out[maxn],idx;
vi buc;
bool vis[maxn];
int depmin(int u,int v){return dep[u]<dep[v]?u:v;}
void dfs(int u){
	dfn[u]=++idx,que[idx]=u,sz[u]=1;
	int ch=0;
	for(auto it:e[u]){
		int v=it.fi,w=it.se;
		if(v==fa[u])continue;
		fe[v]=w;
		++ch;
		fa[v]=u,dep[v]=dep[u]+1;
		dfs(v),sz[u]+=sz[v];
	}out[u]=idx;
	if(ch!=1) buc.pb(u),vis[u]=1;
}

char s[maxn];
int qop[maxn],ql[maxn],qr[maxn];
bool hav[maxn];
ll res[maxn];

int st[maxn];
ll stw[maxn],sum[maxn];
int len,col[maxn];

int minn,maxx;
namespace T{
	int c[maxn],mn[maxn<<2],mx[maxn<<2],leaf[maxn];
	void up(int p){
		mn[p]=min(mn[p<<1],mn[p<<1|1]);
		mx[p]=max(mx[p<<1],mx[p<<1|1]);
	}
	void mdf(int x){
		int p=leaf[x];
		if(!c[x])mn[p]=inf,mx[p]=-inf;
		else mn[p]=mx[p]=col[x]; 
		while(p>>=1)up(p);
	}
	void build(int p,int l,int r){
		if(l==r){
			if(!c[l])mn[p]=inf,mx[p]=-inf;
			else mn[p]=mx[p]=col[l]; 
			leaf[l]=p;
			return;
		}
		int mid=l+r>>1;
		build(p<<1,l,mid),build(p<<1|1,mid+1,r),up(p);
	}
	void ask(int p,int l,int r,int ql,int qr){
		if(l>=ql&&r<=qr){
			minn=min(minn,mn[p]);
			maxx=max(maxx,mx[p]);
			return;
		}
		int mid=l+r>>1;
		if(ql<=mid && (mn[p<<1]<minn||mx[p<<1]>maxx))ask(p<<1,l,mid,ql,qr);
		if(qr>mid  && (mn[p<<1|1]<minn||mx[p<<1|1]>maxx))ask(p<<1|1,mid+1,r,ql,qr);
	}
	void ask(int ql,int qr){
		minn=inf,maxx=-inf;
		ask(1,1,n,ql,qr);
	}
}

int times=0;
void solve(int u)
{
	int uu=u;
	st[len=1]=u;
	while(fa[u]){
		stw[len]=fe[u];
		u=fa[u],st[++len]=u;
		if(vis[u])break;
	}
	u=uu;
	For(i,1,len) sum[i]=sum[i-1]+stw[i];
//	cout<<"work:\n";
//	For(i,1,len) cout<<st[i]<<" ";puts("");
	For(i,1,n)
		if(dfn[i]>=dfn[u] && out[i]<=out[u]) col[i]=1;
		else col[i]=len;
	For(i,1,len) col[st[i]]=i;
//	For(i,1,n)cout<<col[i]<<" "; puts("  col");
	For(i,1,n) T::c[i]=s[i]&1;
	T::build(1,1,n);
	For(i,1,m){
		if(qop[i]==1){
			int x=ql[i];
			T::c[x]^=1;
			T::mdf(x);
		}else{
			int l=ql[i],r=qr[i];
			T::ask(l,r);
			if(minn==inf)continue;
		//	cout<<"L,R "<<i<<" "<<minn<<" "<<maxx<<endl; 
			hav[i]=1;
			res[i]+=2*(sum[maxx-1]-sum[minn-1]);
		}
	}
}

signed main()
{
	n=read(),m=read();
	scanf("%s",s+1);
	For(i,2,n){
		int u=read(),v=read(),w=read();
		e[u].pb(mkp(v,w));
		e[v].pb(mkp(u,w));
	}
	dfs(1);
	For(i,1,m){
		qop[i]=read();
		if(qop[i]==1) ql[i]=read();
		else ql[i]=read(),qr[i]=read();
	}
	assert(buc.size()<=103); 
	for(auto u:buc)solve(u);
	For(i,1,m)if(qop[i]==2){
		if(!hav[i])res[i]=-1;
		printf("%lld\n",res[i]);
	}
	return 0;
}