// 那就是希望。
// 即便需要取模，也是光明。

#include <algorithm>
#include <map>
#include <stdio.h>
#include <vector>
typedef long long llt;
typedef unsigned uint;typedef unsigned long long ullt;
typedef bool bol;typedef char chr;typedef void voi;
typedef double dbl;
template<typename T>bol _max(T&a,T b){return(a<b)?a=b,true:false;}
template<typename T>bol _min(T&a,T b){return(b<a)?a=b,true:false;}
template<typename T>T lowbit(T n){return n&-n;}
template<typename T>T gcd(T a,T b){return b?gcd(b,a%b):a;}
template<typename T>T lcm(T a,T b){return(a!=0||b!=0)?a/gcd(a,b)*b:(T)0;}
template<typename T>T exgcd(T a,T b,T&x,T&y){if(b!=0){T ans=exgcd(b,a%b,y,x);y-=a/b*x;return ans;}else return y=0,x=1,a;}
template<typename T>T power(T base,T index,T mod)
{
    T ans=1%mod;
    while(index)
    {
        if(index&1)ans=ans*base%mod;
        base=base*base%mod,index>>=1;
    }
    return ans;
}
namespace LCT
{
    struct node
    {
        node*son[2],*fath;uint mint,sum,t,w;bol tag;
        node():son{NULL,NULL},fath(NULL),mint(-1u),sum(0),t(-1u),w(0),tag(false){}
        bol ifroot(){return!fath||(this!=fath->son[0]&&this!=fath->son[1]);}
        bol howson(){return this==fath->son[1];}
        voi SWAP(){tag^=1,std::swap(son[0],son[1]);}
        voi pushdown()
        {
            if(tag)
            {
                tag=false;
                if(son[0])son[0]->SWAP();
                if(son[1])son[1]->SWAP();
            }
        }
        voi pushup()
        {
            mint=t,sum=w;
            if(son[0])_min(mint,son[0]->mint),sum+=son[0]->sum;
            if(son[1])_min(mint,son[1]->mint),sum+=son[1]->sum;
        }
        voi update()
        {
            if(!ifroot())fath->update();
            pushdown();
        }
        voi rotate()
        {
            // if(ifroot())return;
            node*f=fath,*ff=fath->fath;bol sk=howson();fath=ff;
            if(!f->ifroot())ff->son[f->howson()]=this;
            if((f->son[sk]=son[!sk]))son[!sk]->fath=f;
            (son[!sk]=f)->fath=this,f->pushup(),pushup();
        }
        voi splay()
        {
            update(),pushup();
            while(!ifroot())
            {
                if(!fath->ifroot())(howson()==fath->howson()?fath:this)->rotate();
                rotate();
            }
        }
        node*access()
        {
            node*p=this,*last=NULL;
            while(p)p->splay(),p->son[1]=last,(last=p)->pushup(),p=p->fath;
            return last;
        }
        voi make(){access()->SWAP();}
        node*find()
        {
            access(),splay();
            node*p=this;while(p->pushdown(),p->son[0])p=p->son[0];
            p->splay();return p;
        }
    }N[400005];
    node*get(uint p){return N+p;}
    voi chgt(node*p,uint t){p->splay(),p->t=t,p->pushup();}
    voi chgw(node*p,uint w){p->splay(),p->w=w,p->pushup();}
    voi link(node*a,node*b){b->make(),b->splay(),b->fath=a;}
    voi split(node*a,node*b){a->make(),b->access(),a->splay();}
    voi cut(node*a,node*b){split(a,b),a->son[1]=b->fath=NULL,a->pushup();}
    bol connected(node*a,node*b){return a->make(),b->find()==a;}
}
uint U[300005],V[300005];
std::map<uint,uint>M;
int main()
{
#ifdef MYEE
    freopen("QAQ.in","r",stdin);
    freopen("QAQ.out","w",stdout);
#endif
    uint q;scanf("%*u%u",&q);
    for(uint t=0;t<q;t++)
    {
        static chr C[15];scanf("%s",C);
        if(*C=='f')
        {
            uint id,t,w;scanf("%u",&id),scanf("%u%u%u%u",&U[id],&V[id],&t,&w),M[t]=id;
            LCT::chgt(LCT::get(id),t),LCT::chgw(LCT::get(id),w);
            bol ok=true;
            if(LCT::connected(LCT::get(U[id]+=q),LCT::get(V[id]+=q)))
            {
                LCT::split(LCT::get(U[id]),LCT::get(V[id])),w=LCT::get(U[id])->mint;
                if(w>t)ok=false;
                else w=M[w],LCT::cut(LCT::get(U[w]),LCT::get(w)),LCT::cut(LCT::get(V[w]),LCT::get(w));
            }
            if(ok)LCT::link(LCT::get(U[id]),LCT::get(id)),LCT::link(LCT::get(V[id]),LCT::get(id));
        }
        else if(*C=='m')
        {
            uint u,v;scanf("%u%u",&u,&v);
            if(!LCT::connected(LCT::get(u+=q),LCT::get(v+=q)))puts("-1");
            else LCT::split(LCT::get(u),LCT::get(v)),printf("%u\n",LCT::get(u)->sum);
        }
        else
        {
            uint id,w;scanf("%u%u",&id,&w),LCT::chgw(LCT::get(id),w);
        }
    }
    return 0;
}

// 那就是希望。
// 即便需要取模，也是光明。