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;
using ll = long long;
template <class T>
void read(T &x) {
  char ch;
  x = 0;
  int f = 1;
  while (isspace(ch = getchar()))
    ;
  if (ch == '-') ch = getchar(), f = -1;
  do x = x * 10 + (ch - '0');
  while (isdigit(ch = getchar()));
  x *= f;
}
template <class T, class... A>
void read(T &x, A &...args) {
  read(x);
  read(args...);
}
using fp = long double;
const int N = 200005;
vector<pair<int, int>> G[N];
int a[N], sz[N], son[N];
bool del[N];
void getsize(int x, int fa = 0) {
  sz[x] = 1;
  son[x] = 0;
  for (const auto &[v, w] : G[x]) {
    if (v == fa || del[v]) continue;
    getsize(v, x);
    sz[x] += sz[v];
    if (sz[v] > sz[son[x]]) son[x] = v;
  }
}
int getg(int x) {
  int g = x;
  while (sz[son[g]] * 2 > sz[x]) g = son[g];
  return g;
}
int pos;
fp val = 1e100;
fp calc(int x, int fa = 0, int dis = 0) {
  fp res = a[x] * pow(dis, 1.5);
  for (const auto &[v, w] : G[x])
    if (v != fa) res += calc(v, x, dis + w);
  return res;
}
fp deriv(int x, int fa = 0, int dis = 0) {
  fp res = 1.5 * a[x] * sqrt(dis);
  for (const auto &[v, w] : G[x])
    if (v != fa) res += deriv(v, x, dis + w);
  return res;
}
void solve(int x) {
  getsize(x);
  int g = getg(x);
  fp v = calc(g);
  if (v < val) val = v, pos = g;
  del[x] = true;
  fp dsum = 0, mxder = 0;
  int mxv = 0;
  for (const auto &[v, w] : G[g]) {
    if (del[v]) continue;
    fp d = deriv(v, x);
    dsum += d;
    if (d > mxder) mxder = d, mxv = v;
  }
  if (mxv && mxder * 2 > dsum) solve(mxv);
}
int main() {
  int n;
  read(n);
  for (int i = 1; i <= n; ++i) read(a[i]);
  for (int i = 1; i < n; ++i) {
    int u, v, w;
    read(u, v, w);
    G[u].emplace_back(v, w);
    G[v].emplace_back(u, w);
  }
  solve(1);
  printf("%d %.18Lf\n", pos, val);
  return 0;
}
