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;
inline int read() {
  int x = 0, f = 1;
  char c = getchar();
  for (; !isdigit(c); c = getchar())
    if (c == '-') f = -1;
  for (; isdigit(c); c = getchar()) x = x * 10 + c - '0';
  return x * f;
}
const int MAXN = 400010;
const int INF = 1e9;
int N;
int w[MAXN + 1];
int Sz, root;
long long dep[MAXN + 1], Cost[MAXN << 1];
int Node[MAXN << 1], Next[MAXN << 1], Root[MAXN + 1], cnt;
bool vis[MAXN + 1];
int sz[MAXN + 1], f[MAXN + 1];
double ret = 0, nowans;
int pos;
double sum[MAXN + 1];
inline void insert(int u, int v, int w) {
  Node[++cnt] = v;
  Next[cnt] = Root[u];
  Root[u] = cnt;
  Cost[cnt] = w;
  return;
}
inline void Getroot(int k, int Fa) {
  f[k] = 0;
  sz[k] = 1;
  for (int x = Root[k]; x; x = Next[x]) {
    int v = Node[x];
    if (v == Fa || vis[v]) continue;
    Getroot(v, k);
    sz[k] += sz[v];
    f[k] = max(f[k], sz[v]);
  }
  f[k] = max(f[k], Sz - sz[k]);
  if (!root || f[root] > f[k]) root = k;
}
inline void solve(int k, int Fa) {
  sz[k] = 1;
  sum[k] = 0;
  for (int x = Root[k]; x; x = Next[x]) {
    int v = Node[x];
    if (v == Fa) continue;
    dep[v] = dep[k] + Cost[x];
    solve(v, k);
    sum[k] += sum[v];
    sz[k] += sz[v];
  }
  sum[k] += (double)pow(dep[k], 0.5);
  ret += (double)pow(dep[k], 1.5) * w[k];
  return;
}
inline void dfs(int k) {
  vis[k] = 1;
  ret = 0;
  dep[k] = 0;
  solve(k, 0);
  if (ret < nowans) nowans = ret, pos = k;
  for (int x = Root[k]; x; x = Next[x]) {
    int v = Node[x];
    if (sum[k] - 2 * sum[v] < 0) {
      if (!vis[v]) {
        root = 0;
        Sz = sz[v];
        Getroot(v, k);
        dfs(root);
      }
      return;
    }
  }
}
int main() {
  N = read();
  for (int i = 1; i <= N; i++) w[i] = read();
  for (int i = 1; i < N; i++) {
    int u = read(), v = read(), l = read();
    insert(u, v, l);
    insert(v, u, l);
  }
  root = 0;
  Sz = N;
  Getroot(1, 0);
  nowans = 1e30;
  dfs(root);
  printf("%d %.15lf\n", pos, nowans);
  return 0;
}
