#include<bits/stdc++.h>
using namespace std;
namespace my_std{
	#define ll long long
	#define bl bool
	ll my_pow(ll a,ll b,ll mod){
		ll res=1;
		if(!b) return 1;
		while(b){
			if(b&1) res=(res*a)%mod;
			a=(a*a)%mod;
			b>>=1;
		}
		return res;
	}
	ll qpow(ll a,ll b){
		ll res=1;
		if(!b) return 1;
		while(b){
			if(b&1) res*=a;
			a*=a;
			b>>=1;
		}
		return res;
	}
	#define db double
	#define pf printf
	#define pc putchar
	#define fr(i,x,y) for(register ll i=(x);i<=(y);i++)
	#define pfr(i,x,y) for(register ll i=(x);i>=(y);i--)
	#define go(u) for(ll i=head[u];i;i=e[i].nxt)
	#define enter pc('\n')
	#define space pc(' ')
	#define fir first
	#define sec second
	#define MP make_pair
	#define il inline
	#define inf 8e18
	#define random(x) rand()*rand()%(x)
	#define inv(a,mod) my_pow((a),(mod-2),(mod))
	#define getchar gc
	il char gc(){static char buf[1000000],*p1=buf,*p2=buf;return p1==p2&&(p2=(p1=buf)+fread(buf,1,1000000,stdin),p1==p2)?EOF:*p1++;}
	il ll read(){ll sum=0,f=0;char ch=getchar();for(;!isdigit(ch);ch=getchar())f|=(ch=='-');for(;isdigit(ch);ch=getchar())sum=((sum<<1)+(sum<<3)+(ch^48));return f?-sum:sum;}
	il void write(ll x){
		if(x<0){
			x=-x;
			pc('-');
		}
		if(x>9) write(x/10);
		pc(x%10+'0');
	}
	il void writeln(ll x){
		write(x);
		enter;
	}
	il void writesp(ll x){
		write(x);
		space;
	}
}
using namespace my_std;
#define LC lc[x]
#define RC rc[x]
vector<ll> vec;
ll n,q,head[200020],cnt=0;
ll f[200020],dep[200020],wson[200020],dfn[400040],st[200020],tot=0;
ll blg[200020],cntt=0,rk[200020][51],lg[400040],minn[400040][20];
ll rt[51],lc[400040],rc[400040],tott=0,len[51];
char s[200020];
struct edge{
	ll nxt,to,w;
}e[400040];
struct node{
	ll minn,maxx;
}tree[400040];
il node operator+(const node &x,const node &y){
	return (node){min(x.minn,y.minn),max(x.maxx,y.maxx)};
}
void add(ll u,ll v,ll ww){
	e[++cnt].nxt=head[u];
	e[cnt].to=v;
	e[cnt].w=ww;
	head[u]=cnt;
}
void dfs(ll fa,ll u){
	f[u]=fa;
	dfn[++tot]=u;
	st[u]=tot;
	go(u){
		ll v=e[i].to;
		if(v==fa) continue;
		if(!wson[u]) wson[u]=v;
		dep[v]=dep[u]+e[i].w;
		dfs(u,v);
		dfn[++tot]=u;
	}
	if(!wson[u]){
		cntt++;
		ll x=u;
		while(1){
			blg[x]=cntt;
			if(!f[x]||wson[f[x]]!=x) break;
			x=f[x];
		}
	}
}
il ll get_dis(ll x,ll y){
	ll l=st[x],r=st[y];
	if(l>r) swap(l,r);
	ll tmp=lg[r-l+1];
	return dep[x]+dep[y]-2*min(minn[l][tmp],minn[r-(1ll<<tmp)+1][tmp]);
}
void mdf(ll &x,ll l,ll r,ll pos,node v){
	if(!x) x=++tott;
	if(l==r){
		tree[x]=v;
		return;
	}
	ll mid=(l+r)>>1;
	if(pos<=mid) mdf(LC,l,mid,pos,v);
	else mdf(RC,mid+1,r,pos,v);
	tree[x]=tree[LC]+tree[RC];
}
node query(ll x,ll l,ll r,ll ql,ll qr){
	if(ql>qr) return tree[0];
	if(!x||(ql<=l&&r<=qr)) return tree[x];
	ll mid=(l+r)>>1;
	node res=tree[0];
	if(ql<=mid) res=res+query(LC,l,mid,ql,qr);
	if(mid<qr) res=res+query(RC,mid+1,r,ql,qr);
	return res;
}
int main(){
	n=read();
	q=read();
	s[1]=getchar();
	while(s[1]!='0'&&s[1]!='1') s[1]=getchar();
	fr(i,2,n) s[i]=getchar();
	fr(i,2,n){
		ll u=read(),v=read(),w=read();
		add(u,v,w);
		add(v,u,w);
	}
	dfs(0,1);
	fr(i,2,tot) lg[i]=lg[i>>1]+1;
	fr(i,1,tot) minn[i][0]=dep[dfn[i]];
	fr(j,1,19) fr(i,1,tot-(1ll<<j)+1) minn[i][j]=min(minn[i][j-1],minn[i+(1ll<<(j-1))][j-1]);
	fr(i,1,n){
		fr(j,1,cntt) rk[i][j]=rk[i-1][j];
		rk[i][blg[i]]++;
	}
	fr(i,1,cntt) len[i]=rk[n][i];
	tree[0]=(node){(ll)inf,-(ll)inf};
	fr(i,1,n) if(s[i]=='1') mdf(rt[blg[i]],1,len[blg[i]],rk[i][blg[i]],(node){st[i],st[i]});
	while(q--){
		ll opt=read();
		if(opt==1){
			ll x=read();
			s[x]^=1;
			if(s[x]=='0') mdf(rt[blg[x]],1,len[blg[x]],rk[x][blg[x]],tree[0]);
			else mdf(rt[blg[x]],1,len[blg[x]],rk[x][blg[x]],(node){st[x],st[x]});
		}
		else{
			ll l=read(),r=read(),ans=0;
			vec.clear();
			fr(i,1,cntt){
				node res=query(rt[i],1,len[i],rk[l-1][i]+1,rk[r][i]);
				if(res.minn!=inf){
					vec.push_back(dfn[res.minn]);
					vec.push_back(dfn[res.maxx]);
				}
			}
			if(vec.empty()){
				writeln(-1);
				continue;
			}
			fr(i,0,(ll)vec.size()-1) ans+=get_dis(vec[i],vec[(i+1)%vec.size()]);
			writeln(ans);
		}
	}
}