JOIよぎ模試.瞬間移動WA.

#include<bits/stdc++.h>

#define int long long int
#define rep(a,b,c) for(int a=b;a<c;a++)
#define repm(a,b,c) for(int a=(b-1);a>=c;a--)
#define pb push_back
#define str string
#define sf(a) scanfs("%d",&a)
#define pb push_back
#define mp make_pair
#define Fi first
#define Se second
#define ALL(v) (v).begin(), (v).end()

using namespace std;

const int INF = 1e18 + 9;
const int Mod = 1e9 + 7;
inline int replac(str s){double ans=0;rep(i,0,s.length()){ans+=(s[i]-'0')*pow(10,s.length()-i-1);}return (int)ans;}
inline string numstr(int m){str s="";while(m>0){char c;int a=m/10;if(a>0)a=m%(a*10);else a=m;c=(char)('0'+a);s+=c;m/=10;}str st="";for(int i=s.size()-1;i>=0;i--){st+=s[i];}return st;}
typedef vector<int> vi;
typedef pair<int,int> pii;
typedef vector<pii> vii;
///(A->to)=cost
struct edge { int to, cost; };
///pii//first...最短距離///second...頂点番号
int V;
const int MAX_V = 100005;//超点数!!
vector<edge> G[MAX_V];
int d[MAX_V];

void dijkstra(int s){
    priority_queue<pii, vector<pii>, greater<pii> > que;
    fill(d,d+V,INF);
    d[s] = 0;
    que.push(pii(0,s));
    while(!que.empty()){
        pii p = que.top(); que.pop();
        int v = p.second;
        if (d[v] < p.first) continue;
        rep(i,0,G[v].size()){
            edge e = G[v][i];
            if(d[e.to] > d[v] + e.cost) {
                d[e.to] = d[v] + e.cost;
                que.push(pii(d[e.to], e.to));
            }
        }
    }
}

signed main()
{
    cin.tie(0);
    ios::sync_with_stdio(false);
    int m,k;
    cin >> V >> m >> k;
    int a,b;
    V++;
    cin >> a >> b;
    rep(i,0,m){
        edge e;
        int x,y,z;
        cin >> x >> y >> z;
        e.to=x;e.cost=z;
        G[y].pb(e);
        e.to=y;
        G[x].pb(e);
    }
    int ans=0;
    dijkstra(a);
    ans=d[b];
    rep(i,0,k){
        int x,y;
        cin >> x >> y;
        ans=max(ans,dp[x]+y);
    }
    cout << ans << endl;
    return 0;
}