#include <cstdio>
#include <iostream>
#include <algorithm>
#include <cstring>
#include <vector>
#include <assert.h>
using namespace std;
#define fi first
#define sc second
#define mkp make_pair
#define pii pair<int,int>
typedef long long ll;
const int N=2e5+5,oo=1e9,mod=1e9+7;
inline int read() {
    int x=0,flag=0;char ch=getchar();
    while(ch<'0'||ch>'9') {flag|=(ch=='-');ch=getchar();}
    while('0'<=ch&&ch<='9') {x=(x<<3)+(x<<1)+ch-'0';ch=getchar();}
    return flag?-x:x;
}
inline int mx(int x,int y) {return x>y?x:y;}
inline int mn(int x,int y) {return x<y?x:y;}
inline void swp(int &x,int &y) {x^=y^=x^=y;}
inline int as(int x) {return x>0?x:-x;}
inline void ckmin(int&x,int y) {x=mn(x,y);}

ll qwq;
int n,m;
struct Node {
    int id,c,t,s;
    bool operator <(const Node &w) {
        return c<w.c;
    }
}a[N];
inline int ef(int V) {
    int l=1,r=n,mid;
    while(l<=r) {
        mid=(l+r)>>1;
        if(a[mid].c<=V) l=mid+1;
        else r=mid-1;
    }
    return r;
}
vector<int> T[N],H[N<<2];
inline void adde(int x,int y) {T[x].push_back(y);}
void Update(int l,int r,int ht,int x,int y,int id) {
    if(x<=l&&r<=y) {H[ht].push_back(id);return ;}
    int mid=(l+r)>>1;
    if(x<=mid) Update(l,mid,ht<<1,x,y,id);
    if(y> mid) Update(mid+1,r,ht<<1|1,x,y,id);
}
pair<pii,int> st[N];int top,f[N],sz[N],val[N],tag[N],ans[N]; bool vis[N];
int ff(int x) {return x==f[x]?x:ff(f[x]);}
inline void merge(int x,int y) {
    int fx=ff(x),fy=ff(y);
    if(fx==fy) return ;
    if(sz[fx]>sz[fy]) {
        st[++top]=mkp(mkp(fx,fy),val[fx]);
        f[fy]=fx; sz[fx]+=sz[fy]; val[fx]=mx(val[fx],mx(val[fy],tag[fy]));
    } else {
        st[++top]=mkp(mkp(fy,fx),val[fy]);
        f[fx]=fy; sz[fy]+=sz[fx]; val[fy]=mx(val[fy],mx(val[fx],tag[fx]));
    }
}
inline void del(int lst) {
    while(top>lst) {
        int u=st[top].fi.fi,v=st[top].fi.sc,s=st[top].sc;
        sz[u]-=sz[v];val[u]=s; f[v]=v; tag[v]=mx(tag[v],tag[u]);
        --top;
    }
}
inline void push(int ht) {
    for(int&x:H[ht]) {
        vis[x]=1;
        for(int&v:T[x])
            if(vis[v]) merge(x,v);
    }
}
void solve(int l,int r,int ht) {
    int lst=top;
    push(ht);
    if(l==r) {
        int x=a[l].id;
        ans[x]=mx(a[l].s,tag[x]);
        for(int&v:T[x])
            if(vis[v]) qwq+=sz[v],ans[x]=mx(ans[x],mx(val[ff(v)],tag[ff(v)]));
        for(int&v:T[x])
            tag[ff(v)]=mx(tag[ff(v)],ans[x]);
        for(int&x:H[ht]) vis[x]=0;
        del(lst);
        return ;
    } int mid=(l+r)>>1;
    solve(mid+1,r,ht<<1|1);
    solve(l,mid,ht<<1);
    for(int&x:H[ht]) vis[x]=0;
    del(lst);
}
int main() {
    n=read();m=read();
    for(int i=1;i<=n;++i) a[i].c=read(),a[i].t=read(),a[i].s=read(),a[i].id=i;
    int pre=a[n].c;
    sort(a+1,a+n+1);
    for(int i=1;i<=n;++i) a[i].c=i,a[i].t=ef(a[i].t);
    for(int i=1,x,y;i<=m;++i) {
        x=read();y=read();
        adde(x,y);adde(y,x);
    }
    for(int i=1;i<=n;++i) 
        if(a[i].c<a[i].t) Update(1,n,1,a[i].c+1,a[i].t,a[i].id);
    for(int i=1;i<=n;++i) f[i]=i,sz[i]=1,val[a[i].id]=a[i].s;
    solve(1,n,1);
    if(qwq>1000000) printf("%lld %d\n",qwq,pre);
    // cerr<<qwq<<endl;
    for(int i=1;i<=n;++i) printf("%d ",ans[i]);
    return 0;
}