3
1 1 5
1 3 42
1 2 42
 2
42 23
1 2 10
 10
45792697 27183921 4791060 77070594 27286110 66957065 19283638 2944837 26775511 65379701
5 8 25
8 10 94
1 4 14
9 7 96
4 2 16
2 6 58
2 3 99
6 8 21
8 9 87
 5
3 1 2 6 5
1 2 3
2 3 1
4 3 9
5 3 1
 10
26 31 21 57 56 44 54 58 79 97
2 1 277
1 8 91
1 7 380
4 1 649
10 5 799
10 1 940
8 6 627
6 3 177
9 6 685
 10
8 100 62 38 26 51 26 23 77 32
6 8 29
4 1 82
7 8 66
7 10 67
8 9 98
6 1 14
1 5 48
3 1 58
2 9 90
 2
23 42
1 2 10
 1
42
 3
1 5 1
1 3 42
1 2 42
 10
1 1 1 1 1 1 1 1 1 1
1 2 5
1 3 5
1 4 5
1 5 5
1 6 5
1 7 5
1 8 5
1 9 5
1 10 5
 3
1 1 1
1 2 42
2 3 42
 3
5 1 1
1 3 42
1 2 24

3 1042.0638260857 1 727.3238618387 6 283959805416.40496826
 3 192.0000000000 1 13952642.4776933547 8 544327.1927847408 2 727.3238618387 1 0.0000000000 2 1042.0638260857 1 100.6230589875 2 544.3822186663 1 389.7666169867
#include <bits/stdc++.h>
using namespace std;
const int N_ = 200500;
int N;
int W[N_];
int L[N_], V[N_];
vector<int> tree[N_];
bool visited[N_];
int ans_f;
double ans_c = 1e55;
int que[N_ + N_];
void check(int r) {
  int qf = 0, qr = 0;
  que[qr++] = r;
  que[qr++] = 0;
  for (int i = 1; i <= N; i++) visited[i] = false;
  visited[r] = true;
  double val = 0;
  while (qf < qr) {
    int u = que[qf++];
    int l = que[qf++];
    val += (double)l * sqrt((double)l) * (double)W[u];
    for (auto e : tree[u]) {
      int v = V[e] ^ u;
      if (visited[v]) continue;
      visited[v] = true;
      que[qr++] = (v);
      que[qr++] = (l + L[e]);
    }
  }
  if (ans_c > val) ans_c = val, ans_f = r;
}
void solve_naive();
void solve_fast();
clock_t start_time;
int main() {
  start_time = clock();
  scanf("%d", &N);
  for (int i = 1; i <= N; i++) {
    scanf("%d", W + i);
  }
  for (int e = 1; e < N; e++) {
    int a, b;
    scanf("%d%d%d", &a, &b, L + e);
    tree[a].push_back(e);
    tree[b].push_back(e);
    V[e] = a ^ b;
  }
  if (N <= 4000)
    solve_naive();
  else
    solve_fast();
  printf("%d %.20lf\n", ans_f, ans_c);
  return 0;
}
void solve_naive() {
  for (int r = 1; r <= N; r++) check(r);
}
double coef[N_][4];
long long sz[N_];
void add_coef(double *cur, double *ch, double delta) {
  cur[0] += ch[0];
  cur[1] += ch[1] + delta * ch[0];
  cur[2] += ch[2] + 2 * delta * ch[1] + (delta * delta) * ch[0];
  cur[3] += ch[3] + 3 * delta * ch[2] + 3 * (delta * delta) * ch[1] +
            (delta * delta * delta) * ch[0];
}
void dfs(int u, int p = -1) {
  coef[u][0] = W[u] * W[u];
  for (auto e : tree[u]) {
    int v = V[e] ^ u;
    if (v == p) continue;
    dfs(v, u);
    add_coef(coef[u], coef[v], L[e]);
  }
}
void dfs2(int u, int p, double up[]) {
  double total[4];
  for (int i = 0; i < 4; i++) total[i] = up[i] + coef[u][i];
  for (auto e : tree[u]) {
    int v = V[e] ^ u;
    if (v == p) continue;
    double chad[4] = {0, 0, 0, 0};
    add_coef(chad, coef[v], L[e]);
    double chex[4] = {0, 0, 0, 0};
    for (int i = 0; i < 4; i++) chex[i] = total[i] - chad[i];
    double chup[4] = {0, 0, 0, 0};
    add_coef(chup, chex, L[e]);
    dfs2(v, u, chup);
  }
  for (int i = 0; i < 4; i++) coef[u][i] += up[i];
}
void solve_fast() {
  double zero[4] = {0, 0, 0, 0};
  dfs(1);
  dfs2(1, -1, zero);
  vector<pair<double, int>> cands;
  for (int i = 1; i <= N; i++)
    cands.push_back(pair<double, int>(coef[i][3], i));
  sort(cands.begin(), cands.end());
  for (int i = 0; i < cands.size(); i++) {
    check(cands[i].second);
    if (clock() - start_time > 1.9 * CLOCKS_PER_SEC) break;
  }
}
