#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<iostream>
#include<algorithm>
#define N 2100000
#define maxn 9999999
using namespace std;
bool vis[N];
long long ans;
int n,m,z,x,y,k,s,tot,sum,top,tim;
int fa[N],dfn[N],low[N],head[N],stack[N],belong[N];
int read()
{
    ,f=; char ch=getchar();
    ; ch=getchar();}
    +ch-'; ch=getchar();}
    return x*f;
}
struct Edde
{
    int x,y,z;
}edde[N];
struct Edge
{
    int to,from,next;
}edge[N<<];
int add(int x,int y)
{
    tot++;
    edge[tot].to=y;
    edge[tot].next=head[x];
    head[x]=tot;
}
int cmp(Edde a,Edde b)
{
    return a.z<b.z;
}
int find(int x)
{
    if(fa[x]==x) return  x;
    fa[x]=find(fa[x]);
    return fa[x];
}
int tarjan(int now)
{
    dfn[now]=low[now]=++tim;
    stack[++top]=now,vis[now]=true;
    for(int i=head[now];i;i=edge[i].next)
    {
        int t=edge[i].to;
        if(vis[t]) low[now]=min(low[now],dfn[t]);
        else if(!dfn[t]) tarjan(t),low[now]=min(low[now],low[t]);
    }
    if(low[now]==dfn[now])
    {
        s++;belong[now]=s;
        for(;stack[top]!=now;top--)
        {
            int x=stack[top];
            belong[x]=s,vis[x]=false;
        }
        top--,vis[now]=false;
    }
}
int main()
{
    freopen("ugrid4.in","r",stdin);
//    freopen("ugrid.out","w",stdout);
    n=read();m=read(),k=read();
    ;i<=m;i++)
    {
       x=read(),y=read(),z=read();
       add(x,y),add(y,x);
       edde[i].x=x;
       edde[i].y=y;
       edde[i].z=z;
    }
    ;i<=n;i++)
     if(!dfn[i]) tarjan(i);
    )
    {
        ;i<=n;i++)
         if(belong[i]!=belong[k]) ans++;
        printf("%d",ans);
        ;
    }
    ;i<=n;i++) fa[i]=i;
    sort(edde+,edde++m,cmp);
    ;i<=m;i++)
    {
        x=edde[i].x,y=edde[i].y;
        int fx=find(x),fy=find(y);
        if(fx==fy) continue;
        fa[fx]=fy;sum++;
        ans+=(long long)edde[i].z;
        ) break;
    }
    printf("%lld",ans);
    ;
}