#include<bits/stdc++.h>
#define RI register int
#define err puts("asd")
#define ll long long
#define ull unsigned long long
#define mk make_pair
#define fl fflush(stdout)
#pragma GCC optimize(2)
//#define int long long
using namespace std;

inline ll read(){
	ll s=0;register char c=getchar();bool f=0;
	while(c<'0'||c>'9'){if(c=='-') f=1;c=getchar();}
	while(c>='0'&&c<='9') s=(s<<3)+(s<<1)+c-48,c=getchar();
	return f?-s:s; 
}

const int N=2e5+5;
const int M=N*32;
const int inf=1e9;

struct wu{
	int n,t,s;
}a[N<<1];

int d[N],T[N],to[N],rt[N],tot,lc[M],rc[M],maxl[M],minl[M],n,m,ru[N],t;
int G[N<<1],f[N<<1][20],k,w[N];
int cnt,D[N],id[N],nd,h[N],p,q[N],t1;
ll dis[N];
int u,v,tong[N<<1],fa[N];
bool vis[N],b[N];

inline void add(int u,int v,int s){
	a[++p].t=v;a[p].s=s;a[p].n=h[u];h[u]=p;
	++ru[u];
}

inline void dfs(int u,int ff){
	d[u]=d[ff]+1;fa[u]=ff;
	G[++k]=u;w[u]=k;
	id[u]=++nd;to[nd]=u;
	for(RI i=h[u];i;i=a[i].n){
		RI v=a[i].t;
		if(v==ff) continue;
		dis[v]=dis[u]+a[i].s;
		dfs(v,u);
		G[++k]=u;
	}
}

inline int minn(int x,int y){
	if(!x||!y) return x^y;
	return d[x]<d[y]?x:y;
}

inline void init(){
	tong[0]=-1;
	for(RI i=1;i<=k;++i) f[i][0]=G[i],tong[i]=tong[i>>1]+1;
	t=tong[k];
	for(RI i=1;i<=t;++i){
		for(RI j=1;j+(1<<i)-1<=k;++j)
			f[j][i]=minn(f[j][i-1],f[j+(1<<i-1)][i-1]);
	}
}

inline int lca(int x,int y){
	x=w[x];y=w[y];
	if(x>y) swap(x,y);
	RI p=tong[y-x+1];
	return minn(f[x][p],f[y-(1<<p)+1][p]);
}

inline int maxx(int x,int y){
	if(!x||!y) return x^y;
	return d[x]>d[y]?x:y;
}	

inline void up(int x){
	//cout<<maxl[lc[x]]<<' '<<maxl[rc[x]]<<endl;
	maxl[x]=maxx(maxl[lc[x]],maxl[rc[x]]);
	minl[x]=minn(minl[lc[x]],minl[rc[x]]);
}

inline void update(int &x,int l,int r,int pos,int v){
	if(!x) x=++tot;
	if(l==r){maxl[x]=minl[x]=v;return;}
	RI mid=l+r>>1;
	if(pos<=mid) update(lc[x],l,mid,pos,v);
	else update(rc[x],mid+1,r,pos,v);
	up(x);
}

inline void ask(int x,int l,int r,int L,int R){
	if(L<=l&&r<=R){u=maxx(u,maxl[x]);v=minn(v,minl[x]);return;}
	RI mid=l+r>>1;
	if(L<=mid) ask(lc[x],l,mid,L,R);
	if(R>mid) ask(rc[x],mid+1,r,L,R);		
}

inline int ask1(int x,int l,int r,int L,int R){
	if(L<=l&&r<=R) return minl[x];
	RI mid=l+r>>1,ans=0;
	if(L<=mid) ans=ask1(lc[x],l,mid,L,R);
	if(R>mid) ans=minn(ans,ask1(rc[x],mid+1,r,L,R));
	return ans;
}

inline int ask2(int x,int l,int r,int L,int R){
	if(L<=l&&r<=R) return maxl[x];
	RI mid=l+r>>1,ans=0;
	if(L<=mid) ans=ask2(lc[x],l,mid,L,R);
	if(R>mid) ans=maxx(ans,ask2(rc[x],mid+1,r,L,R));
	return ans;
}

inline bool cmp(int x,int y){return id[x]<id[y];}

signed main(){
	//freopen("1.cpp","r",stdin);
	//freopen("1.out","w",stdout);
	n=read();m=read();
	RI op,x,y,z,F,g;
	for(RI i=1;i<=n;++i) scanf("%1d",&b[i]);
	for(RI i=1;i<n;++i){
		x=read();y=read();z=read();
		add(x,y,z);add(y,x,z);
	}
	vis[0]=1;
	dfs(1,0);init();
	for(RI i=1+(n>1);i<=n;++i){
		//cout<<i<<endl;
		if(ru[i]==1||i==1){
			x=i;D[++cnt]=i;
			while(!vis[x]){
				vis[x]=1;T[x]=i;
				if(b[x]) update(rt[i],1,n,x,x);
				x=fa[x];
			}
		}
	}
	ll ans;
	while(m--){
		op=read();x=read();
		if(op==1){
			b[x]^=1;
			update(rt[T[x]],1,n,x,b[x]?x:0);
		}
		else{
			y=read();
			t1=0;
			for(RI i=1;i<=cnt;++i){
				z=D[i];
				if(maxl[rt[z]]==0) continue;
				u=v=0;
				ask(rt[z],1,n,x,y);
			//	cout<<"debug "<<u<<' '<<v<<endl;
//				u=ask1(rt[z],1,n,x,y);
				if(u) q[++t1]=u;
//				v=ask2(rt[z],1,n,x,y);
				//if(!m) cout<<"debug "<<u<<' '<<d[1]<<' '<<d[2]<<' '<<x<<' '<<y<<' '<<ask2(rt[z],1,n,2,2)<<endl;
				if(v&&v!=u) q[++t1]=v;
			}
			if(t1==0){puts("-1");continue;}
			sort(q+1,q+t1+1,cmp);
//			for(RI i=1;i<=t1;++i) cout<<q[i]<<' ';
//			cout<<endl;
			ans=0;g=1e9;
			for(RI i=1;i<t1;++i){
				//ans+=dis[q[i]];
				//F=(T[q[i]]^T[q[i+1]])?lca(q[i],q[i+1]):q[i];
				F=lca(q[i],q[i+1]);
				//cout<<F<<endl;
				g=min(g,id[F]);
				ans+=dis[q[i]]-dis[F];
			}
			ans+=dis[q[t1]];
			g=min(g,id[q[t1]]);
			if(g!=1) ans-=dis[to[g]];
			printf("%lld\n",ans<<1);
		}
	}
	return 0;
}