11374 - Airport Express 一直都是wa不知道为什么

http://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&page=show_problem&category=25&problem=2369&mosmsg=Submission+received+with+ID+14744132

#define _CRT_SECURE_NO_WARNINGS
//
#include<iostream>
#include<algorithm> 
#include<cstdio>
#include<string.h>
#include<stdio.h>
#include<math.h> 
#include<vector>
#include<queue>
using namespace std;
const int MAXN = 2000;
int N, S, E;
int M,K;
int x[MAXN], y[MAXN], w[MAXN];
const int INF = 0x3F3F3F3F;// 1000000;
struct Edge
{
	int from, to, dist;
};
struct HeadNode
{
	int d, u;
	bool operator<(const HeadNode& hrs)const{
		return d>hrs.d;
	}
};
int d[2][MAXN];
int p[2][MAXN];
struct Dijkstra
{
	int n,m;
	vector<Edge> edges;
	vector<int> G[MAXN];//每个点对应的边id
	
	bool done[MAXN];
	void init(int n){
		this->n = n;
		for (int i = 0; i < n; i++)
		{
			G[i].clear();
		}
		edges.clear();
	}
	void AddEdge(int from, int to, int dist){
		Edge e = {from,to,dist};
		edges.push_back(e);
		G[e.from].push_back(edges.size()-1);
	}
	void dijkstra(int s,int id){
		priority_queue<HeadNode> Q;
		for (int i = 1; i <= n; i++)
			d[id][i] = INF;
		d[id][s] = 0;
		memset(done,0,sizeof(done));
		HeadNode headnode = {0,s};
		Q.push(headnode);
		while (!Q.empty())
		{
			HeadNode x = Q.top(); Q.pop();
			if (done[x.u])continue;
			done[x.u] = true;
			for (int i = 0; i < G[x.u].size(); i++)
			{
				Edge edge=edges[G[x.u][i]];
				if (d[id][edge.to]>d[id][edge.from] + edge.dist){
					d[id][edge.to] = d[id][edge.from] + edge.dist;
					p[id][edge.to] = edge.from;
					HeadNode h = { d[id][edge.to], edge.to };
					Q.push(h);
				}
			}
		} 
	}
};
void printA(int k, int id){
	if (k == S){
		printf("%d", k);
		return;
	}
	if (id == 0)//开头开始
	{
		int pre = p[id][k];
		printA(pre, id);
		if (!pre)return;
		printf(" %d", k);
	}
}
void printB(int k, int id){
	if (k == E){
		printf(" %d", k);
		return;
	} 
	if (id == 1)//结尾开始
	{
		int pre = p[id][k];
		printf(" %d", k);
		if (!pre)return;
		printB(pre, id);
	}
}
int main(){
	freopen("d:\\uva_in.txt", "r", stdin);
	int ca = 1;
	bool ok = 0;
	while (~scanf("%d%d%d", &N, &S, &E)){
		if (ok)printf("\n\n");
				ok = 1;
		Dijkstra dij;
		dij.init(N);
		scanf("%d",&M);
		for (int i = 0; i < M; i++)
		{
			int a, b, c;
			scanf("%d%d%d", &a, &b, &c);
			dij.AddEdge(a, b, c);
			dij.AddEdge(b, a, c);
		}
		dij.dijkstra(S,0);
		dij.dijkstra(E,1);
		scanf("%d", &K);
		int min = d[0][E];
		int targe1, targe2,ID=-1;
		for (int i = 0; i < K; i++)
		{
			int a, b, c;
			scanf("%d%d%d", &a, &b, &c);
			if (min>d[0][a] + c + d[1][b]){
				min = d[0][a] + c + d[1][b];
				targe1 = a; targe2 = b;
				ID = i;
			}
			if (min>d[0][b] + c + d[1][a]){
				min = d[0][b] + c + d[1][a];
				targe1 = b; targe2 = a;
				ID = i;
			}
		}

		if (ID == -1){
			printA(E, 0); 
			printf("\nTicket Not Used");
		}
		else{
			printA(targe1, 0);

			printB(targe2, 1);
			printf("\n%d", targe1);
		}
		printf("\n%d", min);
	}
}

这是我的测试数据

4 1 4
4
1 2 2
1 3 3
2 4 4
3 4 5
1
2 4 3
4 1 4
4
1 2 2
1 3 3
2 4 4
3 4 5
1
2 4 5
5 1 5
4
1 2 2
3 4 2
2 4 3
3 5 4
1
3 4 1
5 1 5
4
1 2 2
2 3 1
3 5 4
2 4 3
3 4 2
1
3 4 1