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 = 2e5 + 10;
const double inf = 1e20;
int n, m, rt, ans, w[N], siz[N];
bool vis[N];
double sum, sdt, dt[N], Sum = inf;
vector<int> G[N], W[N];
void dfs(int x, int f, int S) {
  siz[x] = 1;
  int mxs = 0;
  for (int i = G[x].size(), y; i; i--) {
    y = G[x][i - 1];
    if (y == f || vis[y]) continue;
    dfs(y, x, S);
    siz[x] += siz[y];
    mxs = max(siz[y], mxs);
  }
  mxs = max(S - siz[x], mxs);
  if (mxs <= (S >> 1)) rt = x;
}
void calc(int x, int f, int o, int dis) {
  sum += pow(dis, 1.5) * w[x];
  dt[o] += 1.5 * pow(dis, 0.5) * w[x];
  for (int i = G[x].size(), y, z; i; i--) {
    y = G[x][i - 1], z = W[x][i - 1];
    if (y == f) continue;
    calc(y, x, o, dis + z);
  }
}
void solve(int x, int S) {
  dfs(x, 0, S);
  x = rt;
  sum = sdt = 0;
  for (int i = G[x].size(), y, z; i; i--) {
    y = G[x][i - 1], z = W[x][i - 1];
    dt[y] = 0;
    calc(y, x, y, z);
    sdt += dt[y];
  }
  if (Sum > sum) Sum = sum, ans = x;
  vis[x] = 1;
  for (int i = G[x].size(), y; i; i--) {
    y = G[x][i - 1];
    if (sdt - 2 * dt[y] >= 0 || vis[y]) continue;
    solve(y, siz[y] > siz[x] ? S - siz[x] : siz[y]);
  }
}
signed main() {
  cin >> n;
  for (int i = 1; i <= n; i++) scanf("%d", w + i);
  for (int i = 1, u, v, w; i < n; i++) {
    scanf("%d%d%d", &u, &v, &w);
    G[u].push_back(v), W[u].push_back(w);
    G[v].push_back(u), W[v].push_back(w);
  }
  solve(1, n);
  printf("%d %.15lf\n", ans, Sum);
  return 0;
}
